Foundations of Modern Query Languages for Graph Databases

@article{Angles2017FoundationsOM,
  title={Foundations of Modern Query Languages for Graph Databases},
  author={Renzo Angles and M. Arenas and P. Barcel{\'o} and A. Hogan and Juan L. Reutter and D. Vrgoc},
  journal={ACM Computing Surveys (CSUR)},
  year={2017},
  volume={50},
  pages={1 - 40}
}
We survey foundational features underlying modern graph query languages. [...] Key Method Thereafter, we discuss navigational expressions, in which patterns can be matched recursively against the graph to navigate paths of arbitrary length; we give an overview of what kinds of expressions have been proposed and how they can be combined with graph patterns. We also discuss several semantics under which queries using the previous features can be evaluated, what effects the selection of features and semantics has…Expand
In-Database Graph Analytics with Recursive SPARQL
TLDR
A minimalistic extension of SParQL to allow for expressing analytical tasks over existing SPARQL infrastructure is proposed, and it is shown that this language can express key analytical tasks on graphs and is Turing complete. Expand
Recursive SPARQL for Graph Analytics
TLDR
A minimalistic extension of SPARQL to allow for expressing analytical tasks is proposed, and it is shown that this language can express key analytical tasks on graphs, offering a more declarative alternative to existing frameworks and languages. Expand
A model and query language for temporal graph databases
TLDR
A temporal graph data model, where nodes and relationships contain attributes (properties) timestamped with a validity interval, is introduced, where graphs in this model can be heterogeneous, that is, relationships may be of different kinds. Expand
Using Queries as Schema-Templates for Graph Databases
TLDR
This article argues that every query consists of a mixture of conceptual information together with evaluation information and that this mixture is not always easy to divide and proposes several matching mechanisms, each mandating a specific semantic meaning of the graph pattern, and discusses their practical applicability. Expand
A survey of typical attributed graph queries
TLDR
This paper proposes a taxonomy of attributed graph queries based on query inputs and outputs and summarizes the definitions of queries that fall into each category and presents a fine-grained classification of queries within each category by analyzing the semantics and algorithmic motivations behind these queries. Expand
Modal Schema Graphs for Graph Databases
TLDR
Modal schema graphs are proposed and studied to increase the expressive power of the original model, and allow for (conditional) structural requirements without an otherwise necessary logical device. Expand
A new Nested Graph Model for Data Integration
TLDR
A novel model (General Semistructured data Model) allowing the representation of both graphs and arbitrarily nested contents is proposed, thus allowing the definition of a nested graph model, where both vertices and edges may include (overlapping) graphs. Expand
Introducing PathQuery, Google's Graph Query Language
TLDR
A language design is shared that admits a rigorous declarative semantics, has scaled well in practice, and provides a natural syntax for graph traversals while also admitting complex graph patterns. Expand
Towards an Integrated Graph Algebra for Graph Pattern Matching with Gremlin
TLDR
Gremlin, a graph traversal language and machine, provides a common platform for supporting any graph computing system (such as an OLTP graph database or OLAP graph processors), and this work presents a formalization of graph pattern matching for Gremlin queries. Expand
Approximate Querying on Property Graphs
TLDR
It is proved the intractability of the optimal graph summarization problem, under the algorithm’s conditions, and the compactness of the obtained summaries as well as the accuracy of answering counting recursive queries on property graphs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 155 REFERENCES
Regular path queries on graphs with data
TLDR
Two types of extensions of regular expressions that are more user-friendly are defined, and query evaluation techniques for them are developed, and it is shown that results extends to analogs of conjunctive regular path queries. Expand
Expressive languages for path queries over graph-structured data
TLDR
A class of extended CRPQs, called ECRPZs, are proposed, which add regular relations on tuples of paths, and allow path variables in the heads of queries, and study their properties. Expand
Expressive Path Queries on Graphs with Data
Graph data models have recently become popular owing to their applications, e.g., in social networks, semantic web. Typical navigational query languages over graph databases — such as ConjunctiveExpand
Querying Regular Graph Patterns
TLDR
This work provides a classification of patterns, and study standard graph queries on graph patterns based on regular expressions, and provides additional restrictions for tractability, and shows that some intractable cases can be naturally cast as instances of constraint satisfaction problems. Expand
Querying Graphs with Data
TLDR
A family of languages that enable combination of data and topology querying for graph databases are presented, and it is shown that it includes efficient and highly expressive formalisms for querying both the structure of the data and the data itself. Expand
The complexity of regular expressions and property paths in SPARQL
TLDR
This work formalizes the W3C semantics of property paths and investigates various query evaluation problems on graphs, proving that the membership problem for regular expressions with numerical occurrence indicators and negation is in polynomial time. Expand
Trial for RDF: adapting graph query languages for RDF data
TLDR
The goal is to introduce languages that work directly over triples and are closed, i.e., they produce sets of triples, rather than graphs, and compares them with relational languages, such as finite-variable logics, and previously studied graph query languages such as adaptations of XPath, regular path queries, and nested regular expressions. Expand
Regular Queries on Graph Databases
TLDR
This work defines the graph query language of Regular Queries, which is a natural extension of unions of conjunctive 2-way regular path queries, and formalizes regular queries as nonrecursive Datalog programs extended with the transitive closure of binary predicates. Expand
PGQL: a property graph query language
TLDR
A new query language for the popular Property Graph (PG) data model: the Property Graph Query Language (PGQL), based on the paradigm of graph pattern matching, closely follows syntactic structures of SQL, and provides regular path queries with conditions on labels and properties to allow for reachability and path finding queries. Expand
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
  • Diego Figueira, L. Libkin
  • Mathematics, Computer Science
  • 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2015
TLDR
It is proved that with Parikh automata defining both languages and relations used in queries, the low complexity of the standard path logics for graphs is retained, and this gives efficient approximations to queries with prohibitively high complexity. Expand
...
1
2
3
4
5
...