Patent
Access controlled graph query spanning
Tor Kreutzer,Steffen Viken Valvåg,Dag Steinnes Eidesen,Amund Kronen Johansen,Peter Dahle Heen,Jan-Ove Almli Karlberg,Jon Meling,Åge Kvalnes +7 more
- 27 Feb 2017
9
TL;DR: In this paper, 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Change monitoring spanning graph queries
Heen Peter Dahle,Eidesen Dag Steinnes,Johansen Amund Kronen,Brattli Dag,Karlberg Jan-Ove Almli,Kreutzer Tor,Kvalnes Åge,Viken Valvåg Steffen +7 more
- 03 May 2018
TL;DR: Approximate Membership Query (AMQ) filters as mentioned in this paper are used in conjunction with graph queries to a relational graph to provide change monitoring that span views associated with the queries, thus saving computing resources and improving the systems hosting and querying the relational graph.
7
Patent
Caching of subgraphs and integration of cached subgraphs into graph query results
Tor Kreutzer,Åge Kvalnes,Steffen Viken Valvåg,Amund Kronen Johansen,Dag Steinnes Eidesen,Peter Dahle Heen,Jan-Ove Almli Karlberg +6 more
- 06 Jan 2017
TL;DR: In this paper, the authors propose a method for caching subgraphs of a graph query in a reusable form to improve the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graph and improving the functionality of the computing devices hosting the relational graphs and running the queries.
6
Patent
Utilization of probabilistic characteristics for reduction of graph database traversals
Steffen Viken Valvåg,Amund Kronen Johansen,Dag Steinnes Eidesen,Åge Kvalnes,Tor Kreutzer,Jan-Ove Almli Karlberg,Peter Dahle Heen +6 more
- 06 Jan 2017
TL;DR: In this paper, an initial node associated with the graph query is identified and the edge type associated the node is extracted from the query by traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type.
6
Patent
Query-time analytics on graph queries spanning subgraphs
Tor Kreutzer,Steffen Viken Valvåg,Åge Kvalnes,Amund Kronen Johansen,Jan-Ove Almli Karlberg,Dag Steinnes Eidesen +5 more
- 30 Sep 2019
TL;DR: In this article, the authors propose a single request to the database maintaining the relationship graph, which improves the computationally efficiency of analyzing relational graphs and thereby improves the functionality of the computing devices hosting the relational graphs.
5
Patent
System and methods for providing query-based permissions to data
David Andrew Haila,Graham Cummins,Robert Ray Lamb,Jeroen Sebastian Cranendonk +3 more
- 05 Jun 2017
TL;DR: In this article, the authors propose a method for generating a database query in a database; receiving a first request to execute the database query on behalf of a first user; in response to the first request, executing the database queries to generate a first set of results such that the first sets of results are limited to data with which there is a semantic relationship in the database to a second datum representing the second user.
2
References
Patent
Methods and apparatus for finding semantic information, such as usage logs, similar to a query using a pattern lattice data space
Steven J. Altschuler,David Ingerman,Lani F. Wu,Lei Zhao +3 more
- 12 Jan 2000
TL;DR: A pattern lattice data space as a framework for analyzing data, in which both schema-based and statistical analysis are accommodated, is defined in this paper, where ways to manage the size of the lattice structures in the pattern lattices data space are described Utilities to classify or cluster, search (find similar data), or relate data using lattice fragments in the Pattern lattice space are also described Superpattern cone or lattice generation function, which may be used by the classification and clustering functions, is also described In addition, a sub-pattern cone and lattice
466
Patent
Responding to a query in a data processing system
Kimberly Keeton,Charles B. Morrey,Craig A. N. Soules +2 more
- 23 May 2011
TL;DR: In this paper, a membership structure is accessed to determine whether partially processed data from a particular one of the processing stages is available or not in response to a query, and the membership structure determines whether the data from the processing stage is available.
218
Patent
System and method for performing selective dynamic compilation using run-time information
Craig Chambers,Susan J. Eggers,Brian Kris Grant,Markus Mock,Matthai Philipose +4 more
- 11 Jun 1999
TL;DR: In this paper, the authors present a system that implements a declarative, annotation based dynamic compilation of the source code, employing a partial evaluation, binding-time analysis (BTA), and including program-point-specific polyvariant division and specialization and dynamic versions of traditional global and peephole optimizations.
191
Patent
Graph query processing using plurality of engines
Sameh Elnikety,Yuxiong He,Sherif Sakr +2 more
- 14 Dec 2013
TL;DR: In this paper, a graph query submitted to a graph database which is modeled by an attributed graph is received, and the graph query is decomposed into a plurality of query components.
181
Patent
Probabilistic summary data structure based encoding for garbage collection
R. Hugo Patterson
- 24 Jul 2007
TL;DR: In this article, a probabilistic summary data structure based encoding for garbage collection is described, which represents active blocks of data within a storage device based on identifications of the active blocks or the data contained within them.
110