Abstract
Many of today's graph query languages are based on graph pattern matching. We investigate optimization for treeshaped patterns with transitive closure. Such patterns are quite expressive, yet can be evaluated efficiently. The minimization problem aims at reducing the number of nodes in patterns and goes back to the early 2000's. 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 also understand the complexity of minimization, which was another question that was open since the early research on the problem. Interestingly, the latter result also shows that, unless standard complexity assumptions are false, more general approaches for minimizing tree patterns are also bound to fail in some cases.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference36 articles.
1. Static analysis of active XML systems
2. Tree pattern query minimization
3. R. Angles M. Arenas P. Barceló A. Hogan J. L. Reutter and D. Vrgoc. Foundations of modern graph query languages. CoRR abs/1610.06264 2016. R. Angles M. Arenas P. Barceló A. Hogan J. L. Reutter and D. Vrgoc. Foundations of modern graph query languages. CoRR abs/1610.06264 2016.
4. Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multi-model query languages: taming the variety of big data;Distributed and Parallel Databases;2023-05-31
2. A Survey on NoSQL Stores;ACM Computing Surveys;2019-03-31
3. Complexity of Conjunctive Regular Path Query Homomorphisms;Computing with Foresight and Industry;2019
4. Optimizing tree pattern queries: why cutting is not enough (invited talk);Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19