ACCESS CONTROLLED GRAPH QUERY SPANNING
Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access cont...
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | JOHANSEN, Amund Kronen KREUTZER, Tor MELING, Jon HEEN, Peter Dahle VIKEN VALVAG, Steffen KVALNES, Age EIDESEN, Dag Steinnes KARLBERG, Jan-Ove Almli |
| description | Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2022343013A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2022343013A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2022343013A13</originalsourceid><addsrcrecordid>eNrjZFBzdHZ2DQ5WcPb3Cwny9_FxdVFwD3IM8FAIDHUNilQIDnD08_P0c-dhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRkbGJsYGhsaOhsbEqQIAVX8kdw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ACCESS CONTROLLED GRAPH QUERY SPANNING</title><source>esp@cenet</source><creator>JOHANSEN, Amund Kronen ; KREUTZER, Tor ; MELING, Jon ; HEEN, Peter Dahle ; VIKEN VALVAG, Steffen ; KVALNES, Age ; EIDESEN, Dag Steinnes ; KARLBERG, Jan-Ove Almli</creator><creatorcontrib>JOHANSEN, Amund Kronen ; KREUTZER, Tor ; MELING, Jon ; HEEN, Peter Dahle ; VIKEN VALVAG, Steffen ; KVALNES, Age ; EIDESEN, Dag Steinnes ; KARLBERG, Jan-Ove Almli</creatorcontrib><description>Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20221027&DB=EPODOC&CC=US&NR=2022343013A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20221027&DB=EPODOC&CC=US&NR=2022343013A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>JOHANSEN, Amund Kronen</creatorcontrib><creatorcontrib>KREUTZER, Tor</creatorcontrib><creatorcontrib>MELING, Jon</creatorcontrib><creatorcontrib>HEEN, Peter Dahle</creatorcontrib><creatorcontrib>VIKEN VALVAG, Steffen</creatorcontrib><creatorcontrib>KVALNES, Age</creatorcontrib><creatorcontrib>EIDESEN, Dag Steinnes</creatorcontrib><creatorcontrib>KARLBERG, Jan-Ove Almli</creatorcontrib><title>ACCESS CONTROLLED GRAPH QUERY SPANNING</title><description>Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFBzdHZ2DQ5WcPb3Cwny9_FxdVFwD3IM8FAIDHUNilQIDnD08_P0c-dhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRkbGJsYGhsaOhsbEqQIAVX8kdw</recordid><startdate>20221027</startdate><enddate>20221027</enddate><creator>JOHANSEN, Amund Kronen</creator><creator>KREUTZER, Tor</creator><creator>MELING, Jon</creator><creator>HEEN, Peter Dahle</creator><creator>VIKEN VALVAG, Steffen</creator><creator>KVALNES, Age</creator><creator>EIDESEN, Dag Steinnes</creator><creator>KARLBERG, Jan-Ove Almli</creator><scope>EVB</scope></search><sort><creationdate>20221027</creationdate><title>ACCESS CONTROLLED GRAPH QUERY SPANNING</title><author>JOHANSEN, Amund Kronen ; KREUTZER, Tor ; MELING, Jon ; HEEN, Peter Dahle ; VIKEN VALVAG, Steffen ; KVALNES, Age ; EIDESEN, Dag Steinnes ; KARLBERG, Jan-Ove Almli</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2022343013A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>JOHANSEN, Amund Kronen</creatorcontrib><creatorcontrib>KREUTZER, Tor</creatorcontrib><creatorcontrib>MELING, Jon</creatorcontrib><creatorcontrib>HEEN, Peter Dahle</creatorcontrib><creatorcontrib>VIKEN VALVAG, Steffen</creatorcontrib><creatorcontrib>KVALNES, Age</creatorcontrib><creatorcontrib>EIDESEN, Dag Steinnes</creatorcontrib><creatorcontrib>KARLBERG, Jan-Ove Almli</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>JOHANSEN, Amund Kronen</au><au>KREUTZER, Tor</au><au>MELING, Jon</au><au>HEEN, Peter Dahle</au><au>VIKEN VALVAG, Steffen</au><au>KVALNES, Age</au><au>EIDESEN, Dag Steinnes</au><au>KARLBERG, Jan-Ove Almli</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ACCESS CONTROLLED GRAPH QUERY SPANNING</title><date>2022-10-27</date><risdate>2022</risdate><abstract>Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2022343013A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
| title | ACCESS CONTROLLED GRAPH QUERY SPANNING |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T10%3A09%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=JOHANSEN,%20Amund%20Kronen&rft.date=2022-10-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2022343013A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |