MSSQ: Manhattan spatial skyline queries

Wanbin Son, Seungwon Hwang, Hee Kap Ahn

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

4 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 Euclidean distance, or, L 2 norm, 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 norm, also known as Manhattan distance, which closely reflects road network distance for metro areas with well-connected road networks. Towards this goal, 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 proposed algorithm has another desirable property of independent computation and extensibility to L norm, 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.

Original languageEnglish
Title of host publicationAdvances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings
Pages313-329
Number of pages17
DOIs
Publication statusPublished - 2011 Sep 19
Event12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011 - Minneapolis, MN, United States
Duration: 2011 Aug 242011 Aug 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6849 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011
CountryUnited States
CityMinneapolis, MN
Period11/8/2411/8/26

Fingerprint

Skyline
Efficient Algorithms
Road Network
Query
Norm
Spatial Data
Euclidean Distance
Parallelism
Retrieval

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Son, W., Hwang, S., & Ahn, H. K. (2011). MSSQ: Manhattan spatial skyline queries. In Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings (pp. 313-329). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6849 LNCS). https://doi.org/10.1007/978-3-642-22922-0_19
Son, Wanbin ; Hwang, Seungwon ; Ahn, Hee Kap. / MSSQ : Manhattan spatial skyline queries. Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. pp. 313-329 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a4201b872207443f82dada82ae0698e0,
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 Euclidean distance, or, L 2 norm, 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 norm, also known as Manhattan distance, which closely reflects road network distance for metro areas with well-connected road networks. Towards this goal, 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 proposed algorithm has another desirable property of independent computation and extensibility to L ∞ norm, 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.",
author = "Wanbin Son and Seungwon Hwang and Ahn, {Hee Kap}",
year = "2011",
month = "9",
day = "19",
doi = "10.1007/978-3-642-22922-0_19",
language = "English",
isbn = "9783642229213",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "313--329",
booktitle = "Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings",

}

Son, W, Hwang, S & Ahn, HK 2011, MSSQ: Manhattan spatial skyline queries. in Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6849 LNCS, pp. 313-329, 12th International Symposium on Advances in Spatial and Temporal Databases, SSTD 2011, Minneapolis, MN, United States, 11/8/24. https://doi.org/10.1007/978-3-642-22922-0_19

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

Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. p. 313-329 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6849 LNCS).

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

TY - GEN

T1 - MSSQ

T2 - Manhattan spatial skyline queries

AU - Son, Wanbin

AU - Hwang, Seungwon

AU - Ahn, Hee Kap

PY - 2011/9/19

Y1 - 2011/9/19

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 Euclidean distance, or, L 2 norm, 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 norm, also known as Manhattan distance, which closely reflects road network distance for metro areas with well-connected road networks. Towards this goal, 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 proposed algorithm has another desirable property of independent computation and extensibility to L ∞ norm, 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.

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 Euclidean distance, or, L 2 norm, 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 norm, also known as Manhattan distance, which closely reflects road network distance for metro areas with well-connected road networks. Towards this goal, 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 proposed algorithm has another desirable property of independent computation and extensibility to L ∞ norm, 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.

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

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

U2 - 10.1007/978-3-642-22922-0_19

DO - 10.1007/978-3-642-22922-0_19

M3 - Conference contribution

AN - SCOPUS:80052771862

SN - 9783642229213

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 313

EP - 329

BT - Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings

ER -

Son W, Hwang S, Ahn HK. MSSQ: Manhattan spatial skyline queries. In Advances in Spatial and Temporal Databases - 12th International Symposium, SSTD 2011, Proceedings. 2011. p. 313-329. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22922-0_19