The farthest spatial skyline queries

Gae Won You, Mu Woong Lee, Hyeonseung Im, Seungwon Hwang

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or "not dominated". Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More specifically, given data points P and query points Q in two-dimensional space, our goal is to retrieve data points that are farther from at least one query point than all the other data points. Such queries are helpful in identifying spatial locations far away from undesirable locations, e.g., unpleasant facilities or business competitors. To solve this problem, we first study a baseline Algorithm TFSS and propose an efficient progressive Algorithm BBFS, which significantly outperforms TFSS by exploiting spatial locality. We also develop an efficient approximation algorithm to trade accuracy for efficiency. We validate our proposed algorithms using extensive evaluations over synthetic and real datasets.

Original languageEnglish
Pages (from-to)286-301
Number of pages16
JournalInformation Systems
Volume38
Issue number3
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

Approximation algorithms
Industry

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

You, Gae Won ; Lee, Mu Woong ; Im, Hyeonseung ; Hwang, Seungwon. / The farthest spatial skyline queries. In: Information Systems. 2013 ; Vol. 38, No. 3. pp. 286-301.
@article{ded97916e9494153b78b2657a8d84f94,
title = "The farthest spatial skyline queries",
abstract = "Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or {"}not dominated{"}. Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More specifically, given data points P and query points Q in two-dimensional space, our goal is to retrieve data points that are farther from at least one query point than all the other data points. Such queries are helpful in identifying spatial locations far away from undesirable locations, e.g., unpleasant facilities or business competitors. To solve this problem, we first study a baseline Algorithm TFSS and propose an efficient progressive Algorithm BBFS, which significantly outperforms TFSS by exploiting spatial locality. We also develop an efficient approximation algorithm to trade accuracy for efficiency. We validate our proposed algorithms using extensive evaluations over synthetic and real datasets.",
author = "You, {Gae Won} and Lee, {Mu Woong} and Hyeonseung Im and Seungwon Hwang",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.is.2012.10.001",
language = "English",
volume = "38",
pages = "286--301",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "3",

}

The farthest spatial skyline queries. / You, Gae Won; Lee, Mu Woong; Im, Hyeonseung; Hwang, Seungwon.

In: Information Systems, Vol. 38, No. 3, 01.01.2013, p. 286-301.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The farthest spatial skyline queries

AU - You, Gae Won

AU - Lee, Mu Woong

AU - Im, Hyeonseung

AU - Hwang, Seungwon

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or "not dominated". Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More specifically, given data points P and query points Q in two-dimensional space, our goal is to retrieve data points that are farther from at least one query point than all the other data points. Such queries are helpful in identifying spatial locations far away from undesirable locations, e.g., unpleasant facilities or business competitors. To solve this problem, we first study a baseline Algorithm TFSS and propose an efficient progressive Algorithm BBFS, which significantly outperforms TFSS by exploiting spatial locality. We also develop an efficient approximation algorithm to trade accuracy for efficiency. We validate our proposed algorithms using extensive evaluations over synthetic and real datasets.

AB - Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or "not dominated". Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More specifically, given data points P and query points Q in two-dimensional space, our goal is to retrieve data points that are farther from at least one query point than all the other data points. Such queries are helpful in identifying spatial locations far away from undesirable locations, e.g., unpleasant facilities or business competitors. To solve this problem, we first study a baseline Algorithm TFSS and propose an efficient progressive Algorithm BBFS, which significantly outperforms TFSS by exploiting spatial locality. We also develop an efficient approximation algorithm to trade accuracy for efficiency. We validate our proposed algorithms using extensive evaluations over synthetic and real datasets.

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

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

U2 - 10.1016/j.is.2012.10.001

DO - 10.1016/j.is.2012.10.001

M3 - Article

AN - SCOPUS:84881256613

VL - 38

SP - 286

EP - 301

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 3

ER -