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...

Full description

Saved in:
Bibliographic Details
Main Authors Viken Valvag, Steffen, Johansen, Amund Kronen, Eidesen, Dag Steinnes, Meling, Jon, Karlberg, Jan-Ove Almli, Kreutzer, Tor, Kvalnes, Age, Heen, Peter Dahle
Format Patent
LanguageEnglish
Published 05.09.2023
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Application Number: US202217661636