Answering Conjunctive Queries under Updates
Summary: Defines q‑hierarchical conjunctive queries: linear preprocessing yields a structure enabling constant‑delay enumeration and constant‑time updates/restarts under tuple insertions/deletions. Provides tight dichotomies: non‑q‑hierarchical (self‑join‑free/Boolean/counting) queries provably lack sublinear update/delay (OMv/OV lower bounds). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Christoph Berkholz (Humboldt University of Berlin)
- 2. Jens Keppeler (Humboldt University of Berlin)
- 3. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{berkholz_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Answering Conjunctive Queries under Updates}},
url = {https://dl.acm.org/doi/10.1145/3034786.3034789},
doi = {10.1145/3034786.3034789},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Berkholz, Christoph and Keppeler, Jens and Schweikardt, Nicole},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 40 of 40 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 62 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00039045511 |
| 402 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00019104625 |
| 977 | Parallel Evaluation of Conjunctive Queries | 2011 | PODS | 0.00012731794 |
| 1,065 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.0001219981 |
| 1,725 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 9.7902443e-05 |
| 1,812 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.5803973e-05 |
| 2,481 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 8.403072e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,292 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 2 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 4 | 3,187 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS |
| 5 | 5,978 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 6 | 13,909 | Enumerating Answers to First-Order Queries over Databases of Low Degree | 2014 | PODS |
| 7 | 6,876 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS |
| 8 | 10,028 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS |
| 9 | 10,387 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS |
| 10 | 10,007 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS |