Document Open Access Logo

The Free Termination Property of Queries over Time

Authors Conor Power , Paraschos Koutris , Joseph M. Hellerstein

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICDT.2025.32.pdf
  • Filesize: 0.71 MB
  • 22 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICDT.2025.32.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
  • Information systems → Parallel and distributed DBMSs
  • Information systems → Stream management
  • Theory of computation → Database theory
Keywords
  • distributed systems
  • algebraic data models
  • coordination-free systems

Metrics

Abstract

Building on prior work on distributed databases and the CALM Theorem, we define and study the question of free termination: in the absence of distributed coordination, what query properties allow nodes in a distributed (database) system to unilaterally terminate execution even though they may receive additional data or messages in the future? This completeness question is complementary to the soundness questions studied in the CALM literature. We also develop a new model based on semiautomata that allows us to bridge from the relational transducer model of the CALM papers to algebraic models that are popular among software engineers (e.g. CRDTs) and of increasing interest to database theory for datalog extensions and incremental view maintenance.

Cite As Get BibTex

Conor Power, Paraschos Koutris, and Joseph M. Hellerstein. The Free Termination Property of Queries over Time. In 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 328, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICDT.2025.32

Author Details

Conor Power
  • University of California Berkeley, CA, USA
Paraschos Koutris
  • University of Wisconsin Madison, WI, USA
Joseph M. Hellerstein
  • University of California Berkeley, CA, USA

Funding

This work is supported in part by gifts from Accenture, AMD, Anyscale, Cisco, Google, IBM, Intel, Intesa Sanpaolo, Lambda, Microsoft, NVIDIA, Samsung SDS, SAP, and VMware.

Acknowledgements

We thank Val Tannen and Dan Suciu for their insightful feedback on this work. This work was made possible by the Simons Institute 2023 session on Logic and Algorithms in Database Theory and AI.

References

  1. Serge Abiteboul, Victor Vianu, Brad Fordham, and Yelena Yesha. Relational transducers for electronic commerce. In Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 179-187, 1998. Google Scholar
  2. Mahmoud Abo Khamis, Hung Q Ngo, Reinhard Pichler, Dan Suciu, and Yisu Remy Wang. Convergence of datalog over (pre-) semirings. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 105-117, 2022. URL: https://doi.org/10.1145/3517804.3524140.
  3. Peter Alvaro, Neil Conway, Joseph M Hellerstein, and William R Marczak. Consistency analysis in bloom: a calm and collected approach. In CIDR, pages 249-260. Citeseer, 2011. URL: http://cidrdb.org/cidr2011/Papers/CIDR11_Paper35.pdf.
  4. Tom J Ameloot, Bas Ketsman, Frank Neven, and Daniel Zinn. Weaker forms of monotonicity for declarative networking: A more fine-grained answer to the calm-conjecture. ACM Transactions on Database Systems (TODS), 40(4):1-45, 2015. URL: https://doi.org/10.1145/2809784.
  5. Tom J Ameloot, Frank Neven, and Jan Van den Bussche. Relational transducers for declarative networking. Journal of the ACM (JACM), 60(2):1-38, 2013. URL: https://doi.org/10.1145/2450142.2450151.
  6. Michael Arntzenius and Neelakantan R Krishnaswami. Datafun: a functional datalog. In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, pages 214-227, 2016. URL: https://doi.org/10.1145/2951913.2951948.
  7. Tim Baccaert and Bas Ketsman. Distributed consistency beyond queries. In Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 47-58, 2023. URL: https://doi.org/10.1145/3584372.3588657.
  8. Eric Brewer. Cap twelve years later: How the" rules" have changed. Computer, 45(2):23-29, 2012. Google Scholar
  9. Mihai Budiu, Tej Chajed, Frank McSherry, Leonid Ryzhyk, and Val Tannen. Dbsp: Automatic incremental view maintenance for rich query languages. Proceedings of the VLDB Endowment, 16(7):1601-1614, 2023. URL: https://doi.org/10.14778/3587136.3587137.
  10. Kevin Clancy and Heather Miller. Monotonicity types for distributed dataflow. In Proceedings of the Programming Models and Languages for Distributed Computing, pages 1-10. 2017. URL: https://doi.org/10.1145/3166089.3166090.
  11. Neil Conway, William R Marczak, Peter Alvaro, Joseph M Hellerstein, and David Maier. Logic and lattices for distributed programming. In Proceedings of the Third ACM Symposium on Cloud Computing, pages 1-14, 2012. Google Scholar
  12. Natacha Crooks, Youer Pu, Lorenzo Alvisi, and Allen Clement. Seeing is believing: A client-centric specification of database isolation. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 73-82, 2017. URL: https://doi.org/10.1145/3087801.3087802.
  13. Stephen Dolan. Brief announcement: The only undoable crdts are counters. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 57-58, 2020. URL: https://doi.org/10.1145/3382734.3405749.
  14. Abraham Ginzburg. Algebraic Theory of Automata. Academic Press, 1968. Google Scholar
  15. Joseph M Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. ACM SIGMOD Record, 39(1):5-19, 2010. URL: https://doi.org/10.1145/1860702.1860704.
  16. Joseph M. Hellerstein and Peter Alvaro. Keeping CALM. Communications of the ACM, 63(9):72-81, August 2020. URL: https://doi.org/10.1145/3369736.
  17. Joseph M Hellerstein, Shadaj Laddad, Mae Milano, Conor Power, and Mingwei Samuel. Initial steps toward a compiler for distributed programs. In Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, pages 1-10, 2023. Google Scholar
  18. Mahmoud Abo Khamis, Hung Q Ngo, Reinhard Pichler, Dan Suciu, and Yisu Remy Wang. Datalog in wonderland. ACM SIGMOD Record, 51(2):6-17, 2022. URL: https://doi.org/10.1145/3552490.3552492.
  19. Christoph Koch. Incremental query evaluation in a ring of databases. In Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 87-98, 2010. URL: https://doi.org/10.1145/1807085.1807100.
  20. Christoph Koch, Yanif Ahmad, Oliver Kennedy, Milos Nikolic, Andres Nötzli, Daniel Lupei, and Amir Shaikhha. Dbtoaster: higher-order delta processing for dynamic, frequently fresh views. The VLDB Journal, 23:253-278, 2014. URL: https://doi.org/10.1007/S00778-013-0348-4.
  21. Lindsey Kuper and Ryan R Newton. Lvars: lattice-based data structures for deterministic parallelism. In Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing, pages 71-84, 2013. URL: https://doi.org/10.1145/2502323.2502326.
  22. Shadaj Laddad, Conor Power, Mae Milano, Alvin Cheung, Natacha Crooks, and Joseph M Hellerstein. Keep calm and crdt on. Proceedings of the VLDB Endowment, 16(4):856-863, 2022. URL: https://doi.org/10.14778/3574245.3574268.
  23. Christopher Meiklejohn and Peter Van Roy. Lasp: A language for distributed, coordination-free programming. In Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, pages 184-195, 2015. URL: https://doi.org/10.1145/2790449.2790525.
  24. Mae Milano, Rolph Recto, Tom Magrino, and Andrew C Myers. A tour of gallifrey, a language for geodistributed programming. In 3rd Summit on Advances in Programming Languages (SNAPL 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. Google Scholar
  25. Conor Power, Saikrishna Achalla, Ryan Cottone, Nathaniel Macasaet, and Joseph M Hellerstein. Wrapping rings in lattices: An algebraic symbiosis of incremental view maintenance and eventual consistency. In Proceedings of the 11th Workshop on Principles and Practice of Consistency for Distributed Data, pages 15-22, 2024. URL: https://doi.org/10.1145/3642976.3653031.
  26. Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski. A comprehensive study of convergent and commutative replicated data types. In Technical Report, Inria-Centre Paris-Rocquencourt; INRIA, 2011. Google Scholar
  27. Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski. Conflict-free replicated data types. In Symposium on Self-Stabilizing Systems, pages 386-400. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-24550-3_29.
  28. Michael Sipser. Introduction to the theory of computation. ACM Sigact News, 27(1):27-29, 1996. URL: https://doi.org/10.1145/230514.571645.
  29. Daniel Zinn, Todd J Green, and Bertram Ludäscher. Win-move is coordination-free (sometimes). In Proceedings of the 15th International Conference on Database Theory, pages 99-113, 2012. URL: https://doi.org/10.1145/2274576.2274588.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact