Database Paper Browser

Back to papers

I/O-Efficient Planar Range Skyline and Attrition Priority Queues

Summary: I/O-optimal linear-space solutions for planar range skyline: static top-open queries solved optimally across continuous, grid and rank-space models; left-open/4-sided queries require Ω((n/B)^ε + k/B) I/Os—matching orthogonal range reporting so skyline adds no extra hardness. Also the first dynamic linear-space structure supporting top-open queries in O(log_{2B^ε} n + k/B^{1-ε}) I/Os with O(log_{2B^ε} n) updates, built atop a new I/O-efficient catenable priority queue with attrition. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1608
Venue
PODS
Year
2013
Pagerank
4.4937074e-05
Overall Rank
8,546 | 40.55%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,334 SLAM: Efficient Sweep Line Algorithms for Kernel Density Visualization 2022 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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