MSSQ: Manhattan spatial skyline queries

Wanbin Son, Seung Won Hwang, Hee Kap Ahn

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Skyline queries have gained attention lately for supporting effective retrieval over massive spatial data. While efficient algorithms have been studied for spatial skyline queries using the Euclidean distance, these algorithms are (1) still quite computationally intensive and (2) unaware of the road constraints. Our goal is to develop a more efficient algorithm for L 1 distance, also known as Manhattan distance, which closely reflects road network distance for metro areas. We present a simple and efficient algorithm which, given a set P of data points and a set Q of query points in the plane, returns the set of spatial skyline points in just O(|P|log|P|) time, assuming that |Q|≤|P|. This is significantly lower in complexity than the best known method. In addition to efficiency and applicability, our algorithm has another desirable property of independent computation and extensibility to L norm distance, which naturally invites parallelism and widens applicability. Our extensive empirical results suggest that our algorithm outperforms the state-of-the-art approaches by orders of magnitude. We also present efficient algorithms that report the changes of the skyline points when single or multiple query points move along the x- or y-axis.

Original languageEnglish
Pages (from-to)67-83
Number of pages17
JournalInformation Systems
Volume40
DOIs
Publication statusPublished - 2014 Jan 1

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

Son, Wanbin ; Hwang, Seung Won ; Ahn, Hee Kap. / MSSQ : Manhattan spatial skyline queries. In: Information Systems. 2014 ; Vol. 40. pp. 67-83.
@article{1a7dcc3f6ae94e6fa6139912de06afdd,
title = "MSSQ: Manhattan spatial skyline queries",
abstract = "Skyline queries have gained attention lately for supporting effective retrieval over massive spatial data. While efficient algorithms have been studied for spatial skyline queries using the Euclidean distance, these algorithms are (1) still quite computationally intensive and (2) unaware of the road constraints. Our goal is to develop a more efficient algorithm for L 1 distance, also known as Manhattan distance, which closely reflects road network distance for metro areas. We present a simple and efficient algorithm which, given a set P of data points and a set Q of query points in the plane, returns the set of spatial skyline points in just O(|P|log|P|) time, assuming that |Q|≤|P|. This is significantly lower in complexity than the best known method. In addition to efficiency and applicability, our algorithm has another desirable property of independent computation and extensibility to L∞ norm distance, which naturally invites parallelism and widens applicability. Our extensive empirical results suggest that our algorithm outperforms the state-of-the-art approaches by orders of magnitude. We also present efficient algorithms that report the changes of the skyline points when single or multiple query points move along the x- or y-axis.",
author = "Wanbin Son and Hwang, {Seung Won} and Ahn, {Hee Kap}",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.is.2013.10.001",
language = "English",
volume = "40",
pages = "67--83",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",

}

MSSQ : Manhattan spatial skyline queries. / Son, Wanbin; Hwang, Seung Won; Ahn, Hee Kap.

In: Information Systems, Vol. 40, 01.01.2014, p. 67-83.

Research output: Contribution to journalArticle

TY - JOUR

T1 - MSSQ

T2 - Manhattan spatial skyline queries

AU - Son, Wanbin

AU - Hwang, Seung Won

AU - Ahn, Hee Kap

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Skyline queries have gained attention lately for supporting effective retrieval over massive spatial data. While efficient algorithms have been studied for spatial skyline queries using the Euclidean distance, these algorithms are (1) still quite computationally intensive and (2) unaware of the road constraints. Our goal is to develop a more efficient algorithm for L 1 distance, also known as Manhattan distance, which closely reflects road network distance for metro areas. We present a simple and efficient algorithm which, given a set P of data points and a set Q of query points in the plane, returns the set of spatial skyline points in just O(|P|log|P|) time, assuming that |Q|≤|P|. This is significantly lower in complexity than the best known method. In addition to efficiency and applicability, our algorithm has another desirable property of independent computation and extensibility to L∞ norm distance, which naturally invites parallelism and widens applicability. Our extensive empirical results suggest that our algorithm outperforms the state-of-the-art approaches by orders of magnitude. We also present efficient algorithms that report the changes of the skyline points when single or multiple query points move along the x- or y-axis.

AB - Skyline queries have gained attention lately for supporting effective retrieval over massive spatial data. While efficient algorithms have been studied for spatial skyline queries using the Euclidean distance, these algorithms are (1) still quite computationally intensive and (2) unaware of the road constraints. Our goal is to develop a more efficient algorithm for L 1 distance, also known as Manhattan distance, which closely reflects road network distance for metro areas. We present a simple and efficient algorithm which, given a set P of data points and a set Q of query points in the plane, returns the set of spatial skyline points in just O(|P|log|P|) time, assuming that |Q|≤|P|. This is significantly lower in complexity than the best known method. In addition to efficiency and applicability, our algorithm has another desirable property of independent computation and extensibility to L∞ norm distance, which naturally invites parallelism and widens applicability. Our extensive empirical results suggest that our algorithm outperforms the state-of-the-art approaches by orders of magnitude. We also present efficient algorithms that report the changes of the skyline points when single or multiple query points move along the x- or y-axis.

UR - http://www.scopus.com/inward/record.url?scp=84888224318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84888224318&partnerID=8YFLogxK

U2 - 10.1016/j.is.2013.10.001

DO - 10.1016/j.is.2013.10.001

M3 - Article

AN - SCOPUS:84888224318

VL - 40

SP - 67

EP - 83

JO - Information Systems

JF - Information Systems

SN - 0306-4379

ER -