Algorithms for range-skyline queries

Saladi Rahul, Ravi Janardan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

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.

Original languageEnglish (US)
Title of host publication20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012
Pages526-529
Number of pages4
DOIs
StatePublished - Dec 1 2012
Event20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012 - Redondo Beach, CA, United States
Duration: Nov 6 2012Nov 9 2012

Other

Other20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2012
Country/TerritoryUnited States
CityRedondo Beach, CA
Period11/6/1211/9/12

Keywords

  • computational hardness
  • geometric transformation
  • query processing
  • range search
  • skyline
  • spatial decomposition

Fingerprint

Dive into the research topics of 'Algorithms for range-skyline queries'. Together they form a unique fingerprint.

Cite this