Database Paper Browser

Back to papers

Indexability of 2D Range Search Revisited: Constant Redundancy and Weak Indivisibility

Summary: Shows explicit external-memory lower bounds for 2D orthogonal range reporting with constant redundancy r, characterizing the query-time/storage tradeoff for every fixed r. Introduces "weak indivisibility" (bits may be split across blocks but must be retrievable) and gives nearly-tight matching upper bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1572
Venue
PODS
Year
2012
Pagerank
4.1945683e-05
Overall Rank
12,106 | 15.79%
DOI
-

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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,845 On Top-k Range Reporting in 2D Space 2015 PODS 4.6365341e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers