AJOSC: Adaptive Join Order Selection for Continuous Queries
Summary: AJOSC uses dynamic programming with a tailored continuous-join cost model to compute optimal multi-way join orders for continuous queries. Lower-bound incremental re-optimization prunes search space as data evolves, yielding up to 100x faster than prior methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xinyi Ye
- 2. Xiangyang Gou
- 3. Lei Zou
- 4. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 24 of 24 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 |
|---|---|---|---|---|
| 2,051 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6871984e-05 |
| 4,734 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9553181e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 10,295 | Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation | 2026 | VLDB | 4.1905499e-05 |
| 3,664 | Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams | 2003 | VLDB | 6.8645092e-05 |
| 8,149 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5715614e-05 |
| 4,526 | Simplicity Done Right for Join Ordering | 2021 | CIDR | 6.1079584e-05 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 1,621 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011105663 |