Algorithms for range-skyline queries

Authors:
Saladi Rahul;Ravi Janardan
Affiliations:
Univ. of Minnesota--Twin Cities, Minneapolis, MN;Univ. of Minnesota--Twin Cities, Minneapolis, MN
Venue:
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Year:
2012

Citing 4
Cited 0

Filtering search: a new approach to query answering

SIAM Journal on Computing
Progressive skyline computation in database systems

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Dynamic planar range maxima queries

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Two-Dimensional range diameter queries

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.