Hangdong Zhao
ABSTRACT
In this paper, we investigate space-time tradeoffs for answering conjunctive queries with access patterns (CQAPs). The goal is to create a space-efficient data structure in an initial preprocessing phase and use it for answering (multiple) queries in an online phase. Previous work has developed data structures that trades off space usage for answering time for queries of practical interest, such as the path and triangle query. However, these approaches lack a comprehensive framework and are not generalizable. Our main contribution is a general algorithmic framework for obtaining space-time tradeoffs for any CQAP. Our framework builds upon the PANDA algorithm and tree decomposition techniques. We demonstrate that our framework captures all state-of-the-art tradeoffs that were independently produced for various queries. Further, we show surprising improvements over the state-of-the-art tradeoffs known in the existing literature for reachability queries.
- Peyman Afshani and Jesper Asbjørn Sindahl Nielsen. Data structure lower bounds for document indexing problems. In ICALP, 2016.Google Scholar
- Rachit Agarwal. The space-stretch-time tradeoff in distance oracles. In ESA, pages 49--60. Springer, 2014.Google ScholarCross Ref
- Rachit Agarwal, P Brighten Godfrey, and Sariel Har-Peled. Approximate distance queries and compact routing in sparse graphs. In INFOCOM, pages 1754--1762. IEEE, 2011.Google ScholarCross Ref
- Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On acyclic conjunctive queries and constant delay enumeration. In CSL, volume 4646 of Lecture Notes in Computer Science, pages 208--222. Springer, 2007.Google ScholarCross Ref
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering conjunctive queries under updates. In PODS, pages 303--318. ACM, 2017.Google ScholarDigital Library
- Angela Bonifati, Wim Martens, and Thomas Timm. An analytical study of large sparql query logs. The VLDB Journal, 29(2):655--679, 2020.Google ScholarCross Ref
- Timothy M Chan and Moshe Lewenstein. Clustered integer 3sum via additive combinatorics. In STOC, pages 31--40, 2015.Google ScholarDigital Library
- Hagai Cohen and Ely Porat. Fast set intersection and two-patterns matching. Theoretical Computer Science, 411(40--42):3795--3800, 2010.Google Scholar
- Hagai Cohen and Ely Porat. On the hardness of distance oracle for sparse graph. arXiv preprint arXiv:1006.1117, 2010.Google Scholar
- Nilesh Dalvi, Christopher Ré, and Dan Suciu. Probabilistic databases: diamonds in the dirt. Communications of the ACM, 52(7):86--94, 2009.Google ScholarDigital Library
- Shaleen Deep, Xiao Hu, and Paraschos Koutris. Enumeration algorithms for conjunctive queries with projection. In 24th International Conference on Database Theory, page 1, 2021.Google Scholar
- Shaleen Deep, Xiao Hu, and Paraschos Koutris. Space-time tradeoffs for answering boolean conjunctive queries. arXiv preprint arXiv:2109.10889, 2021.Google Scholar
- Shaleen Deep and Paraschos Koutris. Compressed representations of conjunctive query results. In PODS, pages 307--322. ACM, 2018.Google ScholarDigital Library
- Shiyuan Deng, Shangqi Lu, and Yufei Tao. Space-query tradeoffs in range sub-graph counting and listing. In 26th International Conference on Database Theory, ICDT 2023, March 28--31, 2023, Ioannina, Greece, pages 6:1--6:25, 2023.Google Scholar
- Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, and Ely Porat. Conditional lower bounds for space/time tradeoffs. In WADS, pages 421--436. Springer, 2017.Google ScholarCross Ref
- Georg Gottlob, Gianluigi Greco, and Francesco Scarcello. Treewidth and hyper-tree width. Tractability: Practical Approaches to Hard Problems, 1, 2014.Google Scholar
- Gianluigi Greco and Francesco Scarcello. Structural tractability of enumerating csp solutions. Constraints, 18(1):38--74, 2013.Google ScholarDigital Library
- Muhammad Idris, Martín Ugarte, and Stijn Vansummeren. The dynamic yannakakis algorithm: Compact and efficient query processing under updates. In Proceedings of the 2017 ACM International Conference on Management of Data, pages 1259--1274, 2017.Google ScholarDigital Library
- Ahmet Kara, Hung Q Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. Counting triangles under updates in worst-case optimal time. In ICDT, 2019.Google Scholar
- Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. Trade-offs in static and dynamic evaluation of hierarchical queries. In PODS, pages 375--392, 2020.Google ScholarDigital Library
- Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. Conjunctive queries with free access patterns under updates. In Proceedings of the 26th International Conference on Database Theory (ICDT 2023), 2022. The 26th International Conference on Database Theory, 2023, ICDT 2023 ; Conference date: 28-03--2023 Through 31-03--2023.Google Scholar
- Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, and Dan Suciu. Bag query containment and information theory. In PODS, pages 95--112. ACM, 2020.Google ScholarDigital Library
- Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. FAQ: questions asked frequently. In PODS, pages 13--28. ACM, 2016.Google ScholarDigital Library
- Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? In PODS, pages 429--444. ACM, 2017.Google ScholarDigital Library
- Tomasz Kociumaka, Jakub Radoszewski, and Wojciech Rytter. Efficient indexes for jumbled pattern matching with constant-sized alphabet. In ESA, pages 625--636. Springer, 2013.Google ScholarCross Ref
- Kasper Green Larsen, J Ian Munro, Jesper Sindahl Nielsen, and Sharma V Thankachan. On hardness of several string indexing problems. Theoretical Computer Science, 582:74--82, 2015.Google ScholarDigital Library
- Dániel Marx. Can you beat treewidth? Theory Comput., 6(1):85--112, 2010.Google ScholarCross Ref
- Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. J. ACM, 60(6):42:1--42:51, 2013.Google ScholarDigital Library
- Hung Q. Ngo, Christopher Ré, and Atri Rudra. Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec., 42(4):5--16, 2013.Google ScholarDigital Library
- Dan Olteanu and Maximilian Schleich. Factorized databases. ACM SIGMOD Record, 45(2):5--16, 2016.Google ScholarDigital Library
- Dan Olteanu and Jakub Závodný. Size bounds for factorised representations of query results. ACM Trans. Database Syst., 40(1):2:1--2:44, 2015.Google ScholarDigital Library
- Mihai Patrascu and Liam Roditty. Distance oracles beyond the thorup-zwick bound. In FOCS, pages 815--823. IEEE, 2010.Google ScholarDigital Library
- Luc Segoufin. Enumerating with constant delay the answers to a query. In ICDT, pages 10--20. ACM, 2013.Google ScholarDigital Library
- Yilei Wang and Ke Yi. Secure yannakakis: Join-aggregate queries over private data. In SIGMOD Conference, pages 1969--1981. ACM, 2021.Google Scholar
- Konstantinos Xirogiannopoulos and Amol Deshpande. Extracting and analyzing hidden graphs from relational databases. CoRR, abs/1701.07388, 2017.Google Scholar
- Mihalis Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82--94. IEEE Computer Society, 1981.Google ScholarDigital Library
- Hangdong Zhao, Shaleen Deep, and Paraschos Koutris. Space-time tradeoffs for conjunctive queries with access patterns. arXiv preprint arXiv:2304.06221, 2023.Google Scholar
Index Terms
- Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
Recommendations
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
PODS '17: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsRecent works on bounding the output size of a conjunctive query with functional dependencies and degree bounds have shown a deep connection between fundamental questions in information theory and database theory. We prove analogous output bounds for ...
Conjunctive query answering in the description logic SH using knots
Answering conjunctive queries (CQs) has been recognized as an important task for the widening use of Description Logics (DLs) in a number of applications. The problem has been studied by many authors, who developed a number of different techniques for ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments