Maintaining Acyclic Foreign-Key Joins under Updates
Summary: Introduces enclosureness λ to quantify update difficulty for acyclic foreign-key joins; amortized O(λ) maintenance for updates. Lower bound Ω(λ^{1-ε}) shows near-optimal; supports all 22 TPC-H queries in ~O(λ); Flink system with gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qichen Wang
- 2. Ke Yi
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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 | Pagerank |
|---|---|---|---|---|
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 11,013 | Mixed Covers of Keys and Functional Dependencies for Maintaining the Integrity of Data under Updates | 2024 | VLDB | 4.1905499e-05 |
| 4,709 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 5.9744219e-05 |
| 212 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033997204 |
| 10,049 | Approximate Query Processing under Updates | 2026 | SIGMOD | 4.1905499e-05 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 4,430 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.1879319e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 9,706 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 4.2951473e-05 |