Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Maintaining Triangle Queries under Updates

Published: 26 August 2020 Publication History

Abstract

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, and the delay for the enumeration of the query result, such that the update time ranges from the square root to linear in the database size while the delay ranges from constant to linear time.
IVMϵ achieves Pareto worst-case optimality in the update-delay space conditioned on the Online Matrix-Vector Multiplication conjecture. It is strongly Pareto optimal for the triangle queries with no or three free variables and weakly Pareto optimal for the remaining triangle queries with one or two free variables.
IVMϵ recovers prior work such as the suboptimal classical view maintenance approach that uses delta query processing and the worst-case optimal approach that computes all triangles in a static database.

Supplementary Material

a11-kara-apndx.pdf (kara.zip)
Supplemental movie, appendix, image and software files for, On Fundamental Principles for Thermal-Aware Design on Periodic Real-Time Multi-Core Systems

References

[1]
Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the FOCS. 434--443.
[2]
Mahmoud Abo Khamis, Hung Q. Ngo, and Atri Rudra. 2016. FAQ: Questions asked frequently. In Proceedings of the PODS. 13--28.
[3]
N. Alon, R. Yuster, and U. Zwick. 1997. Finding and counting given length cycles. Algorithmica 17, 3 (1997), 209--223.
[4]
Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the SODA. 623--632.
[5]
Luca Becchetti, Paolo Boldi, Carlos Castillo, and Aristides Gionis. 2010. Efficient algorithms for large-scale local triangle counting. Trans. Knowl. Discov. Data 4, 3 (2010), 13:1–13:28.
[6]
Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering conjunctive queries under updates. In Proceedings of the PODS. 303--318.
[7]
Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018. Answering UCQs under updates and in the presence of integrity constraints. In Proceedings of the ICDT. 8:1–8:19.
[8]
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, and Uri Zwick. 2014. Listing triangles. In Proceedings of the ICALP. 223--234.
[9]
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, and Rasmus Pagh. 2016. Triangle counting in dynamic graph streams. Algorithmica 76, 1 (2016), 259--278.
[10]
Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler. 2006. Counting triangles in data streams. In Proceedings of the PODS. 253--262.
[11]
Norishige Chiba and Takao Nishizeki. 1985. Arboricity and subgraph listing algorithms. SIAM J. Comput. 14, 1 (1985), 210--223.
[12]
Rada Chirkova and Jun Yang. 2012. Materialized views. Found. Trends Datab. 4, 4 (2012), 295--405.
[13]
Shumo Chu and James Cheng. 2012. Triangle listing in massive networks. Trans. Knowl. Discov. Data 6, 4 (2012), 17:1–17:32.
[14]
Graham Cormode and Hossein Jowhari. 2017. A second look at counting triangles in graph streams (corrected). Theor. Comput. Sci. 683 (2017), 22--30.
[15]
Shaleen Deep and Paraschos Koutris. 2018. Compressed representations of conjunctive query results. In Proceedings of the PODS. 307--322.
[16]
Lech Duraj, Krzysztof Kleiner, Adam Polak, and Virginia Vassilevska Williams. 2020. Equivalences between triangle and range query problems. In Proceedings of the SODA.
[17]
Arnaud Durand and Yann Strozecki. 2011. Enumeration complexity of logical query problems with second-order variables. In Proceedings of the CSL. 189--202.
[18]
Talya Eden, Amit Levi, Dana Ron, and C. Seshadhri. 2015. Approximately counting triangles in sublinear time. In Proceedings of the FOCS. 614--633.
[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 Proceedings of the STOC. 21--30.
[20]
Muhammad Idris, Martín Ugarte, and Stijn Vansummeren. 2017. The Dynamic Yannakakis algorithm: Compact and efficient query processing under updates. In Proceedings of the SIGMOD. 1259--1274.
[21]
Alon Itai and Michael Rodeh. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4 (1978), 413--423.
[22]
Hossein Jowhari and Mohammad Ghodsi. 2005. New streaming algorithms for counting triangles in graphs. In Proceedings of the COCOON. 710--716.
[23]
Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2018. Counting triangles under updates in worst-case optimal time. CoRR abs/1804.02780 (2018).
[24]
Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019a. Counting triangles under updates in worst-case optimal time. In Proceedings of the ICDT. 4:1–4:18.
[25]
Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2020. Maintaining triangle queries under updates. CoRR abs/2004.03716 (2020).
[26]
Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019b. Trade-offs in static and dynamic evaluation of hierarchical queries. CoRR abs/1907.01988 (2019).
[27]
Christoph Koch, Yanif Ahmad, Oliver Kennedy, Milos Nikolic, Andres Nötzli, Daniel Lupei, and Amir Shaikhha. 2014. DBToaster: Higher-order delta processing for dynamic, frequently fresh views. VLDB J. 23, 2 (2014), 253--278.
[28]
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, and Charalampos E. Tsourakakis. 2012. Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math. 8, 1–2 (2012), 161--185.
[29]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2015. Dynamic set intersection. In Proceedings of the WADS. 470--481.
[30]
S. Rao Kosaraju and Mihai Pop. 1998. De-amortization of algorithms. In Proceedings of the COCOON. 4--14.
[31]
Paraschos Koutris, Semih Salihoglu, and Dan Suciu. 2018. Algorithmic aspects of parallel data processing. Found. Trends Datab. 8, 4 (2018), 239--370.
[32]
L. H. Loomis and H. Whitney. 1949. An inequality related to the isoperimetric inequality. J. Bull. Amer. Math. Soc. 55, 55 (1949), 961--962.
[33]
Andrew McGregor, Sofya Vorotnikova, and Hoa T. Vu. 2016. Better algorithms for counting triangles in data streams. In Proceedings of the PODS. 401--411.
[34]
Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra. 2018. Worst-case optimal join algorithms. J. ACM 65, 3 (2018), 16:1–16:40.
[35]
Milos Nikolic and Dan Olteanu. 2018. Incremental view maintenance with triple lock factorization benefits. In Proceedings of the SIGMOD. 365--380.
[36]
Mihai Patrascu. 2010. Towards polynomial lower bounds for dynamic problems. In Proceedings of the STOC. 603--610.
[37]
Thomas Schank and Dorothea Wagner. 2005. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the WEA. 606--609.
[38]
Thomas Schwentick and Thomas Zeume. 2016. Dynamic complexity: Recent updates. SIGLOG News 3, 2 (2016), 30--52.
[39]
Charalampos E. Tsourakakis. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Proceedings of the ICDM. 608--617.
[40]
Ryan Williams. 2007. Matrix-vector multiplication in sub-quadratic time: (Some preprocessing required). In Proceedings of the SODA. 995--1001.
[41]
Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings of the ICM, Vol. 3. 3431--3472.
[42]
Raphael Yuster and Uri Zwick. 1997. Finding even cycles even faster. SIAM J. Discrete Math. 10, 2 (1997), 209--222.
[43]
Thomas Zeume. 2017. The dynamic descriptive complexity of k-clique. Inf. Comput. 256 (2017), 9--22.

Cited By

View all
  • (2024)Tight Bounds of Circuits for Sum-Product QueriesProceedings of the ACM on Management of Data10.1145/36515882:2(1-20)Online publication date: 14-May-2024
  • (2024)Wrapping Rings in Lattices: An Algebraic Symbiosis of Incremental View Maintenance and Eventual ConsistencyProceedings of the 11th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3642976.3653031(15-22)Online publication date: 22-Apr-2024
  • (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
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 45, Issue 3
Best of ICDT 2019 and Regular Papers
September 2020
213 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/3420008
Issue’s Table of Contents
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 the author(s) 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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 August 2020
Online AM: 07 May 2020
Accepted: 01 April 2020
Revised: 01 March 2020
Received: 01 September 2019
Published in TODS Volume 45, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Incremental view maintenance
  2. Pareto worst-case optimality
  3. amortized update time
  4. complexity trade-off
  5. enumeration delay

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • European Union’s Horizon 2020 research and innovation

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)65
  • Downloads (Last 6 weeks)2
Reflects downloads up to 11 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Tight Bounds of Circuits for Sum-Product QueriesProceedings of the ACM on Management of Data10.1145/36515882:2(1-20)Online publication date: 14-May-2024
  • (2024)Wrapping Rings in Lattices: An Algebraic Symbiosis of Incremental View Maintenance and Eventual ConsistencyProceedings of the 11th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3642976.3653031(15-22)Online publication date: 22-Apr-2024
  • (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
  • (2023)DBSP: Automatic Incremental View Maintenance for Rich Query LanguagesProceedings of the VLDB Endowment10.14778/3587136.358713716:7(1601-1614)Online publication date: 1-Mar-2023
  • (2023)Change Propagation Without JoinsProceedings of the VLDB Endowment10.14778/3579075.357908016:5(1046-1058)Online publication date: 1-Jan-2023
  • (2023)Range updates and range sum queries on multidimensional points with monoid weightsComputational Geometry10.1016/j.comgeo.2023.102030115(102030)Online publication date: Dec-2023
  • (2022)Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference GuideACM Journal of Experimental Algorithmics10.1145/355580627(1-45)Online publication date: 12-Aug-2022
  • (2021)Probabilistic Databases under UpdatesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458326(402-415)Online publication date: 20-Jun-2021
  • (2021)Intersection Joins under UpdatesJournal of Computer and System Sciences10.1016/j.jcss.2021.09.004Online publication date: Sep-2021
  • (2020)The relational data borg is learningProceedings of the VLDB Endowment10.14778/3415478.341557213:12(3502-3515)Online publication date: Aug-2020

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media