Affiliation:
1. University of Warsaw, Warsaw, Poland
2. University of Bayreuth, Bayreuth, Germany
Abstract
Many of today’s graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were originally studied for querying tree-structured data, where they can perform child, descendant, node label, and wildcard tests.
The
minimization
problem aims at reducing the number of nodes in patterns and goes back to the early 2000s. We provide an example showing that, in contrast to earlier claims, tree patterns cannot be minimized by deleting nodes only. The example resolves the M =
?
NR problem, which asks if a tree pattern is minimal if and only if it is nonredundant. The example can be adapted to prove that minimization is Σ
P
2
-complete, which resolves another question that was open since the early research on the problem. The latter result shows that, unless NP = Π
P
2
, more general approaches for minimizing tree patterns are also bound to fail in general.
Funder
Poland's National Science Centre
Deutsche Forschungsgemeinschaft
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference42 articles.
1. Static analysis of active XML systems
2. Tree pattern query minimization
3. Renzo Angles Marcelo Arenas Pablo Barceló Aidan Hogan Juan L. Reutter and Domagoj Vrgoc. 2016. Foundations of modern graph query languages. arXiv:1610.06264. Renzo Angles Marcelo Arenas Pablo Barceló Aidan Hogan Juan L. Reutter and Domagoj Vrgoc. 2016. Foundations of modern graph query languages. arXiv:1610.06264.
4. Marcelo Arenas Pablo Barceló Leonid Libkin and Filip Murlak. 2014. Foundations of Data Exchange. Cambridge University Press. Marcelo Arenas Pablo Barceló Leonid Libkin and Filip Murlak. 2014. Foundations of Data Exchange. Cambridge University Press.
5. Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Towards Theory for Real-World Data;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12
2. Conjunctive Regular Path Queries with Capture Groups;ACM Transactions on Database Systems;2022-05-23
3. Learning Disjunctive Multiplicity Expressions and Disjunctive Generalize Multiplicity Expressions From Both Positive and Negative Examples;The Computer Journal;2022-04-18
4. Conjunctive Regular Path Queries with String Variables;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29
5. JSON: Data model and query languages;Information Systems;2020-03