Supporting efficient distributed skyline computation using skyline views

Jongwuk Lee, Jinhan Kim, Seung Won Hwang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Skyline queries return a set of objects, or a skyline, that are not dominated by any other objects. While providing users with an intuitive query formulation, the skyline queries may incur too many results, especially, for high dimensional data. To tackle this problem, subspace skyline queries, which deals with a subset of dimensions, have been recently studied. To identify interesting skylines, users can iteratively refine multiple relevant subspaces for skyline queries. Existing work focuses primarily on supporting efficient subspace skyline computation in centralized databases. In clear contrast, this paper aims to address subspace skyline computation in distributed environments such as the Web. Toward this goal, we make use of pre-computed subspace skylines as views in databases, called skyline views. Specifically, we propose distributed subspace skyline computation which minimizes the total access cost by leveraging the skyline views. Our experimental results validate that our proposed algorithms significantly outperform state-of-the-art algorithms in extensive synthetic datasets.

Original languageEnglish
Pages (from-to)24-37
Number of pages14
JournalInformation sciences
Volume194
DOIs
Publication statusPublished - 2012 Jul 1

Fingerprint

Skyline
Subspace
Query
Costs
Distributed Environment
High-dimensional Data
Intuitive

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

@article{2d52a9ff918d4758b98956cb66fd12ad,
title = "Supporting efficient distributed skyline computation using skyline views",
abstract = "Skyline queries return a set of objects, or a skyline, that are not dominated by any other objects. While providing users with an intuitive query formulation, the skyline queries may incur too many results, especially, for high dimensional data. To tackle this problem, subspace skyline queries, which deals with a subset of dimensions, have been recently studied. To identify interesting skylines, users can iteratively refine multiple relevant subspaces for skyline queries. Existing work focuses primarily on supporting efficient subspace skyline computation in centralized databases. In clear contrast, this paper aims to address subspace skyline computation in distributed environments such as the Web. Toward this goal, we make use of pre-computed subspace skylines as views in databases, called skyline views. Specifically, we propose distributed subspace skyline computation which minimizes the total access cost by leveraging the skyline views. Our experimental results validate that our proposed algorithms significantly outperform state-of-the-art algorithms in extensive synthetic datasets.",
author = "Jongwuk Lee and Jinhan Kim and Hwang, {Seung Won}",
year = "2012",
month = "7",
day = "1",
doi = "10.1016/j.ins.2011.10.009",
language = "English",
volume = "194",
pages = "24--37",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

Supporting efficient distributed skyline computation using skyline views. / Lee, Jongwuk; Kim, Jinhan; Hwang, Seung Won.

In: Information sciences, Vol. 194, 01.07.2012, p. 24-37.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Supporting efficient distributed skyline computation using skyline views

AU - Lee, Jongwuk

AU - Kim, Jinhan

AU - Hwang, Seung Won

PY - 2012/7/1

Y1 - 2012/7/1

N2 - Skyline queries return a set of objects, or a skyline, that are not dominated by any other objects. While providing users with an intuitive query formulation, the skyline queries may incur too many results, especially, for high dimensional data. To tackle this problem, subspace skyline queries, which deals with a subset of dimensions, have been recently studied. To identify interesting skylines, users can iteratively refine multiple relevant subspaces for skyline queries. Existing work focuses primarily on supporting efficient subspace skyline computation in centralized databases. In clear contrast, this paper aims to address subspace skyline computation in distributed environments such as the Web. Toward this goal, we make use of pre-computed subspace skylines as views in databases, called skyline views. Specifically, we propose distributed subspace skyline computation which minimizes the total access cost by leveraging the skyline views. Our experimental results validate that our proposed algorithms significantly outperform state-of-the-art algorithms in extensive synthetic datasets.

AB - Skyline queries return a set of objects, or a skyline, that are not dominated by any other objects. While providing users with an intuitive query formulation, the skyline queries may incur too many results, especially, for high dimensional data. To tackle this problem, subspace skyline queries, which deals with a subset of dimensions, have been recently studied. To identify interesting skylines, users can iteratively refine multiple relevant subspaces for skyline queries. Existing work focuses primarily on supporting efficient subspace skyline computation in centralized databases. In clear contrast, this paper aims to address subspace skyline computation in distributed environments such as the Web. Toward this goal, we make use of pre-computed subspace skylines as views in databases, called skyline views. Specifically, we propose distributed subspace skyline computation which minimizes the total access cost by leveraging the skyline views. Our experimental results validate that our proposed algorithms significantly outperform state-of-the-art algorithms in extensive synthetic datasets.

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

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

U2 - 10.1016/j.ins.2011.10.009

DO - 10.1016/j.ins.2011.10.009

M3 - Article

AN - SCOPUS:84859156998

VL - 194

SP - 24

EP - 37

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -