Processing Top-k Join Queries
Summary: Top-k join processing over web databases uses branch-and-bound to avoid exhaustive evaluation. Introduces incremental score bounds during discovery (sorted or random access) and an access-order strategy to minimize wasted work; experiments show gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,845 | Optimal Join Algorithms Meet Top-k | 2020 | SIGMOD | 5.3057391e-05 |
| 5,963 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2485815e-05 |
| 7,845 | Progressive Join Algorithms Considering User Preference | 2021 | CIDR | 4.6327267e-05 |
| 9,353 | Rank Join Queries in NoSQL Databases | 2014 | VLDB | 4.3485003e-05 |
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 |
|---|---|---|---|---|
| 8 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015436578 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 630 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00018942778 |
| 673 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00018325667 |
| 1,612 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB | 0.00011142757 |
| 1,805 | Top-k Query Evaluation with Probabilistic Guarantees | 2004 | VLDB | 0.00010479371 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.620459e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |
| 12,119 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1905499e-05 |
| 3,911 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD | 6.6343292e-05 |
| 7,273 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.775366e-05 |
| 3,665 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB | 6.8631567e-05 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 2,965 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 7.8049517e-05 |
| 802 | Evaluating Top-k Selection Queries | 1999 | VLDB | 0.00016440813 |
| 673 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00018325667 |
| 5,845 | Optimal Join Algorithms Meet Top-k | 2020 | SIGMOD | 5.3057391e-05 |