Database Paper Browser

Back to papers

A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting

Summary: External-memory dynamic structure for one-dimensional top-k range reporting using linear space, answering queries in O(lg_B n + k/B) I/Os. Supports amortized updates in O(lg_B n) I/Os, improving prior O(lg_B^2 n) update bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1619
Venue
PODS
Year
2014
Pagerank
4.1945683e-05
Overall Rank
11,965 | 16.77%
DOI
10.1145/259438.2594543

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
7,845 On Top-k Range Reporting in 2D Space 2015 PODS 4.6365341e-05
11,825 Efficient Top-k Indexing via General Reductions 2016 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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,182 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) 1999 PODS 0.00013455963
7,846 Dynamic Top-K Range Reporting in External Memory 2012 PODS 4.6365341e-05
Previous Page 1 / 1 Next

Semantically Similar Papers