Insert-Only versus Insert-Delete in Dynamic Query Evaluation
Summary: Dynamic query evaluation for full conjunctive Q under updates; insert-only sequences on an empty DB incur O(N^{w(Q)}) total time, matching static evaluation and yielding constant amortized inserts for alpha-acyclic Q. Allowing inserts and deletes, reduce to Q_hat by encoding tuple lifespans; total time O~(N^{w(Q_hat)}), tight via static evaluation of Q_hat, achieving amortized optimal updates for hierarchical and Loomis–Whitney joins. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (RelationalAI)
- 2. Ahmet Kara (Ostbayerische Technische Hochschule Regensburg)
- 3. Dan Olteanu (University of Zurich)
- 4. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{khamis_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Insert-Only versus Insert-Delete in Dynamic Query Evaluation}},
url = {https://dl.acm.org/doi/10.1145/3695837},
doi = {10.1145/3695837},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Kara, Ahmet and Olteanu, Dan and Suciu, Dan},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,845 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 5.2094004e-05 |
| 10,148 | Size Bound-Adorned Datalog | 2026 | PODS | 5.093636e-05 |
| 10,160 | Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations | 2026 | PODS | 5.093636e-05 |
| 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,342 | Approximate Query Processing under Updates | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 816 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD |
| 2 | 8,235 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 3 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 4 | 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 5 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 6 | 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS |
| 7 | 9,819 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS |
| 8 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 9 | 9,845 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS |
| 10 | 3,136 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS |