Back to papers
Conjunctive Queries with Inequalities Under Updates
Summary: IEDyn dynamically maintains conjunctive queries with theta-joins under updates, avoiding materialization and recomputation. It generalizes Dynamic Yannakakis to theta-joins and extends acyclicity/free-connexity, achieving two orders of magnitude gains.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11780
- Venue
- VLDB
- Year
- 2018
- Pagerank
- 5.4211286e-05
- Overall Rank
- 5,582 | 61.21%
- DOI
-
10.14778/3192965.3192966
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 151 |
An Evaluation of Non-Equijoin Algorithms |
1991 |
VLDB |
0.00041010211 |
| 242 |
Generalized Search Trees for Database Systems (Extended Abstract) |
1995 |
VLDB |
0.00031093647 |
| 259 |
High-Performance Complex Event Processing over Streams |
2006 |
SIGMOD |
0.00030155645 |
| 585 |
DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views |
2012 |
VLDB |
0.00019682634 |
| 770 |
Answering Conjunctive Queries under Updates |
2017 |
PODS |
0.0001686092 |
| 772 |
Efficient Pattern Matching over Event Streams |
2008 |
SIGMOD |
0.00016790632 |
| 832 |
Learning Linear Regression Models over Factorized Joins |
2016 |
SIGMOD |
0.00016089705 |
| 1,054 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.00014397587 |
| 1,231 |
Incremental Query Evaluation in a Ring of Databases |
2010 |
PODS |
0.00013141213 |
| 1,255 |
Aggregation and Ordering in Factorised Databases |
2013 |
VLDB |
0.00013011216 |
| 1,417 |
ZStream: A Cost-based Query Processor for Adaptively Detecting Composite Events |
2009 |
SIGMOD |
0.00012084678 |
| 2,029 |
On Complexity and Optimization of Expensive Queries in Complex Event Processing |
2014 |
SIGMOD |
9.7344839e-05 |
| 3,214 |
Cayuga: A High-Performance Event Processing Engine |
2007 |
SIGMOD |
7.3708419e-05 |
| 3,703 |
How to Win a Hot Dog Eating Contest: Distributed Incremental View Maintenance with Batch Updates |
2016 |
SIGMOD |
6.8249334e-05 |
| 4,200 |
Incremental View Maintenance with Triple Lock Factorization Benefits |
2018 |
SIGMOD |
6.3618329e-05 |
| 4,738 |
Joining Interval Data in Relational Databases |
2004 |
SIGMOD |
5.9526916e-05 |
| 9,284 |
Processing Inequality Queries Based On Generalized Semi-Joins |
1984 |
VLDB |
4.3595614e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,035 |
Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores |
2025 |
VLDB |
4.5967078e-05 |
| 6,094 |
Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited |
1989 |
SIGMOD |
5.2099705e-05 |
| 9,706 |
Towards Update-Dependent Analysis of Query Maintenance |
2025 |
PODS |
4.2951473e-05 |
| 10,049 |
Approximate Query Processing under Updates |
2026 |
SIGMOD |
4.1905499e-05 |
| 5,963 |
Beyond Equi-joins: Ranking, Enumeration and Factorization |
2021 |
VLDB |
5.2485815e-05 |
| 7,465 |
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees |
2025 |
SIGMOD |
4.7186055e-05 |
| 8,428 |
Insert-Only versus Insert-Delete in Dynamic Query Evaluation |
2024 |
PODS |
4.5095504e-05 |
| 8,587 |
Output-Optimal Algorithms for Join-Aggregate Queries |
2025 |
PODS |
4.4853975e-05 |
| 8,972 |
Output-sensitive Conjunctive Query Evaluation |
2024 |
PODS |
4.4150824e-05 |
| 1,054 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.00014397587 |