Spatial skyline queries: Exact and approximation algorithms

Mu Woong Lee, Wanbin Son, Hee Kap Ahn, Seungwon Hwang

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.

Original languageEnglish
Pages (from-to)665-697
Number of pages33
JournalGeoInformatica
Volume15
Issue number4
DOIs
Publication statusPublished - 2011 Oct 1

Fingerprint

Approximation algorithms
Set theory
Geographic information systems
spatial data
ranking
Semantics
information system
father
semantics
efficiency

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Geography, Planning and Development

Cite this

Lee, Mu Woong ; Son, Wanbin ; Ahn, Hee Kap ; Hwang, Seungwon. / Spatial skyline queries : Exact and approximation algorithms. In: GeoInformatica. 2011 ; Vol. 15, No. 4. pp. 665-697.
@article{ed1a36159acb4e388b950060cec8a588,
title = "Spatial skyline queries: Exact and approximation algorithms",
abstract = "As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.",
author = "Lee, {Mu Woong} and Wanbin Son and Ahn, {Hee Kap} and Seungwon Hwang",
year = "2011",
month = "10",
day = "1",
doi = "10.1007/s10707-010-0119-y",
language = "English",
volume = "15",
pages = "665--697",
journal = "GeoInformatica",
issn = "1384-6175",
publisher = "Kluwer Academic Publishers",
number = "4",

}

Spatial skyline queries : Exact and approximation algorithms. / Lee, Mu Woong; Son, Wanbin; Ahn, Hee Kap; Hwang, Seungwon.

In: GeoInformatica, Vol. 15, No. 4, 01.10.2011, p. 665-697.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Spatial skyline queries

T2 - Exact and approximation algorithms

AU - Lee, Mu Woong

AU - Son, Wanbin

AU - Ahn, Hee Kap

AU - Hwang, Seungwon

PY - 2011/10/1

Y1 - 2011/10/1

N2 - As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.

AB - As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.

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

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

U2 - 10.1007/s10707-010-0119-y

DO - 10.1007/s10707-010-0119-y

M3 - Article

AN - SCOPUS:80052970614

VL - 15

SP - 665

EP - 697

JO - GeoInformatica

JF - GeoInformatica

SN - 1384-6175

IS - 4

ER -