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

  • Authors:

  • Ken C. Lee;Wang-Chien Lee;Baihua Zheng;Huajing Li;Yuan Tian

  • Affiliations:

  • The Department of Computer Science and Engineering, The Pennsylvania State University, University Park, USA 16802;The Department of Computer Science and Engineering, The Pennsylvania State University, University Park, USA 16802;School of Information Systems, Singapore Management University, Singapore, Singapore;The Department of Computer Science and Engineering, The Pennsylvania State University, University Park, USA 16802;The Department of Computer Science and Engineering, The Pennsylvania State University, University Park, USA 16802

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.