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)

Paper ID: 1955
Venue: PODS
Year: 2024
Pagerank: 4.5138778e-05
Overall Rank: 8,437 | 41.31%
DOI: 10.1145/3695837

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,707	Towards Update-Dependent Analysis of Query Maintenance	2025	PODS	4.299267e-05
10,049	Approximate Query Processing under Updates	2026	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
583	FAQ: Questions Asked Frequently	2016	PODS	0.00019717214
586	DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views	2012	VLDB	0.00019685374
772	Answering Conjunctive Queries under Updates	2017	PODS	0.00016876498
1,056	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.0001441128
1,238	Incremental Query Evaluation in a Ring of Databases	2010	PODS	0.00013114581
1,442	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00011956109
2,255	LINVIEW: Incremental View Maintenance for Complex Analytical Queries	2014	SIGMOD	9.1884983e-05
3,781	Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries	2020	PODS	6.7723513e-05
4,197	Incremental View Maintenance with Triple Lock Factorization Benefits	2018	SIGMOD	6.367895e-05
4,613	F-IVM: Learning over Fast-Evolving Relational Data	2020	SIGMOD	6.0478676e-05
5,625	Complex Event Recognition in the Big Data Era	2017	VLDB	5.4044959e-05
5,944	DBSP: Automatic Incremental View Maintenance for Rich Query Languages	2023	VLDB	5.2628186e-05
5,967	Change Propagation Without Joins	2023	VLDB	5.250976e-05
6,299	Incremental View Maintenance For Collection Programming	2016	PODS	5.1225782e-05
6,695	Maintaining Acyclic Foreign-Key Joins under Updates	2020	SIGMOD	4.9582125e-05
7,332	The Complexity of Boolean Conjunctive Queries with Intersection Joins	2022	PODS	4.7606012e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,721	Aggregated Deletion Propagation for Counting Conjunctive Query Answers	2021	VLDB	4.4608778e-05
1,056	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.0001441128
8,159	Computing Complex Temporal Join Queries Efficiently	2022	SIGMOD	4.5729025e-05
3,715	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	6.8220943e-05
7,162	Computing the Difference of Conjunctive Queries Efficiently	2023	SIGMOD	4.8132423e-05
915	The Complexity of Evaluating Relational Queries	1983	PODS	0.0001538509
9,653	Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration	2021	PODS	4.3109001e-05
772	Answering Conjunctive Queries under Updates	2017	PODS	0.00016876498
9,707	Towards Update-Dependent Analysis of Query Maintenance	2025	PODS	4.299267e-05
3,781	Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries	2020	PODS	6.7723513e-05