Database Paper Browser

Back to papers

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)

Paper ID
1685
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,825 | 17.74%
DOI
10.1145/2902251.2902290

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,462 Algorithmic Techniques for Independent Query Sampling 2022 PODS 5.0536751e-05
9,322 Indexing for Keyword Search with Structured Constraints 2023 PODS 4.3556432e-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
986 Managing Intervals Efficiently in Object-Relational Databases 2000 VLDB 0.00014838568
1,502 Efficient Searching with Linear Constraints (Extended Abstract) 1998 PODS 0.00011643406
6,917 Categorical Range Maxima Queries 2014 PODS 4.8925595e-05
7,845 On Top-k Range Reporting in 2D Space 2015 PODS 4.6365341e-05
7,846 Dynamic Top-K Range Reporting in External Memory 2012 PODS 4.6365341e-05
11,965 A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting 2014 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers