Efficient Top-k Indexing via General Reductions
Summary: General reductions in external memory that transform prioritized-reporting (threshold queries) into static top-k structures with only an O(log_B n) query-time slowdown under mild conditions. Combining prioritized-reporting with max-reporting gives expected-time top-k with no asymptotic slowdown in space, query, or updates; techniques apply to many geometric queries and also work in RAM. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Saladi Rahul (University of Minnesota)
- 2. Yufei Tao (University of Queensland)
BibTeX Citation
@inproceedings{rahul_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Efficient Top-k Indexing via General Reductions}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902290},
doi = {10.1145/2902251.2902290},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Rahul, Saladi and Tao, Yufei},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,527 | Algorithmic Techniques for Independent Query Sampling | 2022 | PODS | 6.1861709e-05 |
| 9,472 | Indexing for Keyword Search with Structured Constraints | 2023 | PODS | 5.2634238e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,139 | Managing Intervals Efficiently in Object-Relational Databases | 2000 | VLDB | 0.0001202217 |
| 1,561 | Efficient Searching with Linear Constraints (Extended Abstract) | 1998 | PODS | 0.00010361147 |
| 7,521 | Categorical Range Maxima Queries | 2014 | PODS | 5.6029996e-05 |
| 8,172 | On Top-k Range Reporting in 2D Space | 2015 | PODS | 5.4740049e-05 |
| 8,173 | Dynamic Top-K Range Reporting in External Memory | 2012 | PODS | 5.4740049e-05 |
| 12,163 | A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting | 2014 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,500 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD |
| 2 | 8,750 | I/O-Efficient Planar Range Skyline and Attrition Priority Queues | 2013 | PODS |
| 3 | 3,317 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB |
| 4 | 1,529 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 5 | 8,172 | On Top-k Range Reporting in 2D Space | 2015 | PODS |
| 6 | 9,073 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS |
| 7 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 8 | 7,299 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 9 | 12,163 | A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting | 2014 | PODS |
| 10 | 8,173 | Dynamic Top-K Range Reporting in External Memory | 2012 | PODS |