4 citations · 12 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 2 cited
I/O-Efficient Planar Range Skyline and Attrition Priority Queues
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis +2
In the planar range skyline reporting problem, we store a set P of n 2D points in a structure such that, given a query rectangle Q = [a_1, a_2] x [b_1, b_2], the maxima (a.k.a. sky…
cs.DS2012
A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting
Yufei Tao
We present a structure in external memory for "top-k range reporting", which uses linear space, answers a query in O(lg_B n + k/B) I/Os, and supports an update in O(lg_B n) amortiz…
cs.DS2012
Optimal Planar Range Skyline Reporting with Linear Space in External Memory
Yufei Tao, Jeonghun Yoon
Let P be a set of n points in R^2. Given a rectangle Q = [α_1, α_2] x [β_1, β_2], a range skyline query returns the maxima of the points in P \cap Q. An important variant is the so…