The Free Termination Property of Queries Over Time
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915132547792896 |
|---|---|
| author | Power, Conor Koutris, Paraschos Hellerstein, Joseph M |
| author_facet | Power, Conor Koutris, Paraschos Hellerstein, Joseph M |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_00222 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Free Termination Property of Queries Over Time Power, Conor Koutris, Paraschos Hellerstein, Joseph M Databases Distributed, Parallel, and Cluster Computing Programming Languages 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. |
| title | The Free Termination Property of Queries Over Time |
| topic | Databases Distributed, Parallel, and Cluster Computing Programming Languages |
| url | https://arxiv.org/abs/2502.00222 |