Z-SKY: An efficient skyline query processing framework based on Z-order

Ken C.K. Lee, Wang Chien Lee, Baihua Zheng, Huajing Li, Yuan Tian

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

Given a set of data points in a multidimensional space, a skyline query retrieves those data points that are not dominated by any other point in the same dataset. Observing that the properties of Z-order space filling curves (or Z-order curves) perfectly match with the dominance relationships among data points in a geometrical data space, we, in this paper, develop and present a novel and efficient processing framework to evaluate skyline queries and their variants, and to support skyline result updates based on Z-order curves. This framework consists of ZBtree, i. e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert, ZDelete and ZUpdate, which incrementally maintain skyline results in presence of source dataset updates, (3) ZBand, which answers skyband queries, (4) ZRank, which returns top-ranked skyline points, (5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. While derived upon coherent ideas and concepts, our approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.

Original languageEnglish (US)
Pages (from-to)333-362
Number of pages30
JournalVLDB Journal
Volume19
Issue number3
DOIs
StatePublished - Jan 1 2010

Fingerprint

Query processing
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture

Cite this

Lee, Ken C.K. ; Lee, Wang Chien ; Zheng, Baihua ; Li, Huajing ; Tian, Yuan. / Z-SKY : An efficient skyline query processing framework based on Z-order. In: VLDB Journal. 2010 ; Vol. 19, No. 3. pp. 333-362.
@article{6ea79428b4be4e1b80c9dc9018172bf3,
title = "Z-SKY: An efficient skyline query processing framework based on Z-order",
abstract = "Given a set of data points in a multidimensional space, a skyline query retrieves those data points that are not dominated by any other point in the same dataset. Observing that the properties of Z-order space filling curves (or Z-order curves) perfectly match with the dominance relationships among data points in a geometrical data space, we, in this paper, develop and present a novel and efficient processing framework to evaluate skyline queries and their variants, and to support skyline result updates based on Z-order curves. This framework consists of ZBtree, i. e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert, ZDelete and ZUpdate, which incrementally maintain skyline results in presence of source dataset updates, (3) ZBand, which answers skyband queries, (4) ZRank, which returns top-ranked skyline points, (5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. While derived upon coherent ideas and concepts, our approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.",
author = "Lee, {Ken C.K.} and Lee, {Wang Chien} and Baihua Zheng and Huajing Li and Yuan Tian",
year = "2010",
month = "1",
day = "1",
doi = "10.1007/s00778-009-0166-x",
language = "English (US)",
volume = "19",
pages = "333--362",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "3",

}

Z-SKY : An efficient skyline query processing framework based on Z-order. / Lee, Ken C.K.; Lee, Wang Chien; Zheng, Baihua; Li, Huajing; Tian, Yuan.

In: VLDB Journal, Vol. 19, No. 3, 01.01.2010, p. 333-362.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Z-SKY

T2 - An efficient skyline query processing framework based on Z-order

AU - Lee, Ken C.K.

AU - Lee, Wang Chien

AU - Zheng, Baihua

AU - Li, Huajing

AU - Tian, Yuan

PY - 2010/1/1

Y1 - 2010/1/1

N2 - Given a set of data points in a multidimensional space, a skyline query retrieves those data points that are not dominated by any other point in the same dataset. Observing that the properties of Z-order space filling curves (or Z-order curves) perfectly match with the dominance relationships among data points in a geometrical data space, we, in this paper, develop and present a novel and efficient processing framework to evaluate skyline queries and their variants, and to support skyline result updates based on Z-order curves. This framework consists of ZBtree, i. e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert, ZDelete and ZUpdate, which incrementally maintain skyline results in presence of source dataset updates, (3) ZBand, which answers skyband queries, (4) ZRank, which returns top-ranked skyline points, (5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. While derived upon coherent ideas and concepts, our approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.

AB - Given a set of data points in a multidimensional space, a skyline query retrieves those data points that are not dominated by any other point in the same dataset. Observing that the properties of Z-order space filling curves (or Z-order curves) perfectly match with the dominance relationships among data points in a geometrical data space, we, in this paper, develop and present a novel and efficient processing framework to evaluate skyline queries and their variants, and to support skyline result updates based on Z-order curves. This framework consists of ZBtree, i. e., an index structure to organize a source dataset and skyline candidates, and a suite of algorithms, namely, (1) ZSearch, which processes skyline queries, (2) ZInsert, ZDelete and ZUpdate, which incrementally maintain skyline results in presence of source dataset updates, (3) ZBand, which answers skyband queries, (4) ZRank, which returns top-ranked skyline points, (5) k-ZSearch, which evaluates k-dominant skyline queries, and (6) ZSubspace, which supports skyline queries on a subset of dimensions. While derived upon coherent ideas and concepts, our approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.

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

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

U2 - 10.1007/s00778-009-0166-x

DO - 10.1007/s00778-009-0166-x

M3 - Article

AN - SCOPUS:77953134193

VL - 19

SP - 333

EP - 362

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 3

ER -