Algorithms for range-skyline queries
Saladi Rahul, Ravi Janardan · 2012
Let S be a set of n points in Rd where each point has t ≥ 1 real-valued attributes called features. A range-skyline query on S takes as input a query box q ε Rd and returns the skyline of the points of q ∩ S, computed w.r.t. their features (not their coordinates in Rd). Efficient algorithms are given for computing range-skylines and a related hardness result is established.