Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
60 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Recent Increments in Incremental View Maintenance (2404.17679v1)

Published 26 Apr 2024 in cs.DB and cs.DS

Abstract: We overview recent progress on the longstanding problem of incremental view maintenance (IVM), with a focus on the fine-grained complexity and optimality of IVM for classes of conjunctive queries. This theoretical progress guided the development of IVM engines that reported practical benefits in academic papers and industrial settings. When taken in isolation, each of the reported advancements is but a small increment. Yet when taken together, they may well pave the way to a deeper understanding of the IVM problem. This paper accompanies the invited Gems of PODS 2024 talk with the same title. Some of the works highlighted in this paper are based on prior or on-going collaborations with: Ahmet Kara, Milos Nikolic, and Haozhe Zhang in the F-IVM project; and Mahmoud Abo Khamis, Niko G\"obel, Hung Ngo, and Dan Suciu at RelationalAI.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. Foundations of differential dataflow. In A. M. Pitts, editor, FoSSaCS, volume 9034, pages 71–83, 2015.
  2. Insert-Only versus Insert-Delete in Dynamic Query Evaluation. CoRR, abs/2312.09331, 2023.
  3. FAQ: Questions Asked Frequently. In PODS, pages 13–28, 2016.
  4. Answering Conjunctive Queries Under Updates. In PODS, pages 303–318, 2017.
  5. Answering UCQs under Updates and in the Presence of Integrity Constraints. In ICDT, pages 8:1–8:19, 2018.
  6. C. Berkholz and M. Merz. Probabilistic databases under updates: Boolean query evaluation and ranked enumeration. In PODS, pages 402–415, 2021.
  7. DBSP: Automatic Incremental View Maintenance for Rich Query Languages. Proc. VLDB Endow., 16(7):1601–1614, 2023.
  8. R. Chirkova and J. Yang. Materialized Views. Found. & Trends Datab., 4(4):295–405, 2012.
  9. Reachability is in dynfo. J. ACM, 65(5):33:1–33:24, 2018.
  10. Parallel batch-dynamic k-clique counting. In APOCS, pages 129–143, 2021.
  11. A. Durand and E. Grandjean. First-order Queries on Structures of Bounded Degree are Computable with Constant Delay. ACM Trans. Comput. Logic, 8(4):21, 2007.
  12. Rewriting with acyclic queries: Mind your head. Log. Methods Comput. Sci., 19(4), 2023.
  13. Provenance Semirings. In PODS, pages 31–40, 2007.
  14. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In STOC, pages 21–30, 2015.
  15. The dynamic yannakakis algorithm: Compact and efficient query processing under updates. In SIGMOD, pages 1259–1274, 2017.
  16. General dynamic yannakakis: Conjunctive queries with theta joins under updates. VLDB J., 29(2-3):619–653, 2020.
  17. Tractable conjunctive queries over static and dynamic relations, 2024. Tech. rep.
  18. Counting triangles under updates in worst-case optimal time. In ICDT, pages 4:1–4:18, 2019.
  19. Maintaining triangle queries under updates. ACM Trans. Database Syst., 45(3):11:1–11:46, 2020.
  20. Trade-offs in static and dynamic evaluation of hierarchical queries. In PODS, pages 375–392, 2020.
  21. Conjunctive queries with free access patterns under updates. In ICDT, pages 17:1–17:20, 2023.
  22. F-IVM: Analytics over Relational Databases under Updates. VLDB J., 2023.
  23. Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. Log. Methods Comput. Sci., 19(3), 2023.
  24. Conjunctive queries with free access patterns under updates, 2024.
  25. C. Koch. Incremental Query Evaluation in a Ring of Databases. In PODS, pages 87–98, 2010.
  26. Dbtoaster: Higher-order delta processing for dynamic, frequently fresh views. VLDB J., 23(2):253–278, 2014.
  27. Incremental view maintenance for collection programming. In PODS, pages 75–90, 2016.
  28. Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J., 27(5):643–668, 2018.
  29. S. Lu and Y. Tao. Towards optimal dynamic indexes for approximate (and exact) triangle counting. In ICDT, pages 6:1–6:23, 2021.
  30. Maintenance of datalog materialisations revisited. Artif. Intell., 269:76–136, 2019.
  31. Worst-case Optimal Join Algorithms. J. ACM, 65(3):16:1–16:40, 2018.
  32. LINVIEW: incremental view maintenance for complex analytical queries. In SIGMOD, pages 253–264, 2014.
  33. M. Nikolic and D. Olteanu. Incremental view maintenance with triple lock factorization benefits. In SIGMOD, pages 365–380, 2018.
  34. F-IVM: learning over fast-evolving relational data. In SIGMOD, pages 2773–2776, 2020.
  35. SPROUT: lazy vs. eager query plans for tuple-independent probabilistic databases. In ICDE, pages 640–651, 2009.
  36. D. Olteanu and J. Závodný. Factorised representations of query results: Size bounds and readability. In ICDT, pages 285–298, 2012.
  37. D. Olteanu and J. Závodný. Size Bounds for Factorised Representations of Query Results. ACM Trans. Database Syst., 40(1):2:1–2:44, 2015.
  38. J. Schwabe. Cavier: Cascading view ttrees. Master’s thesis, University of Zurich, Switzerland, July 2023.
  39. Sketches of dynamic complexity. SIGMOD Rec., 49(2):18–29, 2020.
  40. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.
  41. Y. Tao and K. Yi. Intersection joins under updates. J. Comput. Syst. Sci., 124:41–64, 2022.
  42. T. L. Veldhuizen. Triejoin: A simple, worst-case optimal join algorithm. In ICDT, pages 96–106, 2014.
  43. Change propagation without joins. Proc. VLDB Endow., 16(5):1046–1058, 2023.
  44. V. V. Williams. Some open problems in fine-grained complexity. SIGACT News, 49(4):29–35, 2018.
  45. M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, pages 82–94, 1981.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now

HackerNews

  1. Recent Increments in Incremental View Maintenance (2 points, 0 comments)