@inproceedings{c81b2b82e0e446259e04aeb9eb583d92,
title = "Algorithms for range-skyline queries",
abstract = "Let S be a set of n points in ℝd where each point has t ≥ 1 real-valued attributes called features. A range-skyline query on S takes as input a query box q ε ℝd and returns the skyline of the points of q ∩ S, computed w.r.t. their features (not their coordinates in ℝd). Efficient algorithms are given for computing range-skylines and a related hardness result is established.",
keywords = "computational hardness, geometric transformation, query processing, range search, skyline, spatial decomposition",
author = "Saladi Rahul and Ravi Janardan",
year = "2012",
doi = "10.1145/2424321.2424406",
language = "English (US)",
isbn = "9781450316910",
series = "GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems",
pages = "526--529",
booktitle = "20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012",
note = "20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012 ; Conference date: 06-11-2012 Through 09-11-2012",
}