research-article

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries

Authors:

Haozhe ZhangAuthors Info & Claims

PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Pages 375 - 392

https://doi.org/10.1145/3375395.3387646

Published: 14 June 2020 Publication History

Abstract

We investigate trade-offs in static and dynamic evaluation of hierarchical queries with arbitrary free variables. In the static setting, the trade-off is between the time to partially compute the query result and the delay needed to enumerate its tuples. In the dynamic setting, we additionally consider the time needed to update the query result under single-tuple inserts or deletes to the database.

Our approach observes the degree of values in the database and uses different computation and maintenance strategies for high-degree (heavy) and low-degree (light) values. For the latter it partially computes the result, while for the former it computes enough information to allow for on-the-fly enumeration.

The main result of this work defines the preprocessing time, the update time, and the enumeration delay as functions of the light/heavy threshold. By conveniently choosing this threshold, our approach recovers a number of prior results when restricted to hierarchical queries.

For a restricted class of hierarchical queries, our approach can achieve worst-case optimal update time and enumeration delay conditioned on the Online Matrix-Vector Multiplication Conjecture.

References

[1]

Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. 2016. FAQ: Questions Asked Frequently. In PODS. 13--28.

Digital Library

[2]

Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2017. A Circuit-Based Approach to Efficient Enumeration. In ICALP. 111:1--111:15.

[3]

Antoine Amarilli, Pierre Bourhis, and Stefan Mengel. 2018. Enumeration on Trees under Relabelings. In ICDT. 5:1--5:18.

[4]

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019. Constant-Delay Enumeration for Nondeterministic Document Spanners. In ICDT. 22:1--22:19.

[5]

Albert Atserias, Martin Grohe, and Dániel Marx. 2013. Size Bounds and Query Plans for Relational Joins. SIAM J. Comput., Vol. 42, 4 (2013), 1737--1767.

Digital Library

[6]

Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In CSL. 208--222.

[7]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017a. Answering Conjunctive Queries Under Updates. In PODS. 303--318.

[8]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017b. Answering FO

[9]

MOD Queries Under Updates on Bounded Degree Databases. In ICDT. 8:1--8:18.

[10]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018. Answering UCQs under Updates and in the Presence of Integrity Constraints. In ICDT. 8:1--8:19.

[11]

Johann Brault-Baron. 2013. De la pertinence de l'énumération: complexité en logiques propositionnelle et du premier ordre. Ph.D. Dissertation. Université de Caen .

[12]

Nofar Carmeli and Markus Kröll. 2018. Enumeration Complexity of Conjunctive Queries with Functional Dependencies. In ICDT. 11:1--11:17.

[13]

Rada Chirkova and Jun Yang. 2012. Materialized Views. Found. & Trends DB, Vol. 4, 4 (2012), 295--405.

[14]

Shaleen Deep and Paraschos Koutris. 2018. Compressed Representations of Conjunctive Query Results. In PODS. 307--322.

[15]

Arnaud Durand and Etienne Grandjean. 2007. First-order Queries on Structures of Bounded Degree are Computable with Constant Delay. ACM Trans. Comput. Logic, Vol. 8, 4 (2007), 21.

Digital Library

[16]

Arnaud Durand and Yann Strozecki. 2011. Enumeration Complexity of Logical Query Problems with Second-order Variables. In CSL. 189--202.

[17]

Robert Fink and Dan Olteanu. 2016. Dichotomies for Queries with Negation in Probabilistic Databases. ACM Trans. Datab. Syst., Vol. 41, 1 (2016), 4:1--4:47.

[18]

Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, and Jan Van den Bussche. 2009. Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst., Vol. 44, 4 (2009), 533--560.

Digital Library

[19]

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In STOC. 21--30.

[20]

Xiao Hu and Ke Yi. 2019. Instance and Output Optimal Parallel Algorithms for Acyclic Joins. In PODS. 450--463.

[21]

Muhammad Idris, Mart'in Ugarte, and Stijn Vansummeren. 2017. The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates. In SIGMOD. 1259--1274.

[22]

Muhammad Idris, Mart'i n Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner. 2018. Conjunctive Queries with Inequalities Under Updates. PVLDB (2018), 733--745.

[23]

Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019 a. Counting Triangles under Updates in Worst-Case Optimal Time. In ICDT. 4:1--4:18.

[24]

Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019 b. Counting Triangles under Updates in Worst-Case Optimal Time. CoRR, Vol. abs/1804.02780 (2019).

[25]

Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019 c. Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. CoRR, Vol. abs/1907.01988 (2019).

[26]

Wojciech Kazana and Luc Segoufin. 2011. First-order Query Evaluation on Structures of Bounded Degree. LMCS, Vol. 7, 2 (2011).

[27]

Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2017. What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?. In PODS. 429--444.

[28]

Christoph Koch. 2010. Incremental Query Evaluation in a Ring of Databases. In PODS. 87--98.

[29]

Christoph Koch et al. 2014. DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views. VLDB J., Vol. 23, 2 (2014), 253--278.

[30]

Paraschos Koutris and Dan Suciu. 2011. Parallel evaluation of conjunctive queries. In PODS. 223--234.

[31]

Katja Losemann and Wim Martens. 2014. MSO queries on trees: enumerating answers under updates. In CSL-LICS. 67:1--67:10.

[32]

Dániel Marx. 2010. Approximating fractional hypertree width. ACM Trans. Alg., Vol. 6, 2 (2010), 29:1--29:17.

[33]

Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra. 2018. Worst-case Optimal Join Algorithms. J. ACM, Vol. 65, 3 (2018), 16:1--16:40.

Digital Library

[34]

Matthias Niewerth. 2018. MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. In LICS. 769--778.

[35]

Milos Nikolic and Dan Olteanu. 2018. Incremental View Maintenance with Triple Lock Factorization Benefits. In SIGMOD. 365--380.

[36]

Dan Olteanu and Maximilian Schleich. 2016. Factorized Databases. SIGMOD Rec., Vol. 45, 2 (2016), 5--16.

Digital Library

[37]

Dan Olteanu and Závodný. 2012. Factorised representations of query results: size bounds and readability. In ICDT. 285--298.

[38]

Dan Olteanu and Jakub Závodný. 2015. Size Bounds for Factorised Representations of Query Results. ACM TODS, Vol. 40, 1 (2015), 2:1--2:44.

Digital Library

[39]

Luc Segoufin. 2015. Constant Delay Enumeration for Conjunctive Queries. SIGMOD Rec., Vol. 44, 1 (2015), 10--17.

Digital Library

[40]

Dan Suciu, Dan Olteanu, Christopher Ré, and Christoph Koch. 2011. Probabilistic Databases. Morgan & Claypool Publishers.

[41]

Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94.

Cited By

Muñoz MRiveros C(2024)Streaming enumeration on nested documentsACM Transactions on Database Systems10.1145/3701557Online publication date: 25-Oct-2024
https://doi.org/10.1145/3701557
Deep SZhao HFan AKoutris P(2024)Output-sensitive Conjunctive Query EvaluationProceedings of the ACM on Management of Data10.1145/36958382:5(1-24)Online publication date: 7-Nov-2024
https://dl.acm.org/doi/10.1145/3695838
Abo Khamis MKara AOlteanu DSuciu D(2024)Insert-Only versus Insert-Delete in Dynamic Query EvaluationProceedings of the ACM on Management of Data10.1145/36958372:5(1-26)Online publication date: 7-Nov-2024
https://dl.acm.org/doi/10.1145/3695837
Show More Cited By

Index Terms

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
        Query optimization
        Query planning
      2. Stream management

Recommendations

The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates
SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data

Modern computing tasks such as real-time analytics require refresh of query results under high update rates. Incremental View Maintenance (IVM) approaches this problem by materializing results in order to avoid recomputation. IVM naturally induces a ...
Maintaining Triangle Queries under Updates
Best of ICDT 2019 and Regular Papers

We consider the problem of incrementally maintaining the triangle queries with arbitrary free variables under single-tuple updates to the input relations.

We introduce an approach called IVMϵ that exhibits a trade-off between the update time, the space, ...
Differential evaluation of continual queries
ICDCS '96: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

We define continual queries as a useful tool for monitoring of updated information. Continual queries are standing queries that monitor the source data and notify the users whenever new data matches the query. In addition to periodic refresh, continual ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

June 2020

480 pages

ISBN:9781450371087

DOI:10.1145/3375395

General Chair:
Dan Suciu
University of Washington, USA
,
Program Chair:
Yufei Tao
Chinese University of Hong Kong, China
,
Publications Chair:
Zhewei Wei
Renmin University of China, China

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Horizon 2020

Conference

SIGMOD/PODS '20

Sponsor:

SIGMOD

SIGMOD/PODS '20: International Conference on Management of Data

June 14 - 19, 2020

OR, Portland, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
255
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Muñoz MRiveros C(2024)Streaming enumeration on nested documentsACM Transactions on Database Systems10.1145/3701557Online publication date: 25-Oct-2024
https://doi.org/10.1145/3701557
Deep SZhao HFan AKoutris P(2024)Output-sensitive Conjunctive Query EvaluationProceedings of the ACM on Management of Data10.1145/36958382:5(1-24)Online publication date: 7-Nov-2024
https://dl.acm.org/doi/10.1145/3695838
Abo Khamis MKara AOlteanu DSuciu D(2024)Insert-Only versus Insert-Delete in Dynamic Query EvaluationProceedings of the ACM on Management of Data10.1145/36958372:5(1-26)Online publication date: 7-Nov-2024
https://dl.acm.org/doi/10.1145/3695837
Dai BHu XYi K(2024)Reservoir Sampling over JoinsProceedings of the ACM on Management of Data10.1145/36549212:3(1-26)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654921
Olteanu DGeerts FMartens W(2024)Recent Increments in Incremental View MaintenanceCompanion of the 43rd Symposium on Principles of Database Systems10.1145/3635138.3654763(8-17)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3635138.3654763
Wang QHu XDai BYi K(2023)Change Propagation Without JoinsProceedings of the VLDB Endowment10.14778/3579075.357908016:5(1046-1058)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.14778/3579075.3579080
Zhao HDeep SKoutris PGeerts FNgo HSintos S(2023)Space-Time Tradeoffs for Conjunctive Queries with Access PatternsProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588675(59-68)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588675
Kara ANikolic MOlteanu DZhang H(2023)F-IVM: analytics over relational databases under updatesThe VLDB Journal10.1007/s00778-023-00817-w33:4(903-929)Online publication date: 14-Nov-2023
https://doi.org/10.1007/s00778-023-00817-w
Deep SHu XKoutris P(2023)General Space-Time Tradeoffs via Relational QueriesAlgorithms and Data Structures10.1007/978-3-031-38906-1_21(309-325)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_21
Deep SHu XKoutris P(2022)Ranked enumeration of join queries with projectionsProceedings of the VLDB Endowment10.14778/3510397.351040115:5(1024-1037)Online publication date: 18-May-2022
https://dl.acm.org/doi/10.14778/3510397.3510401
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents