Publication Type

Journal Article

Version

publishedVersion

Publication Date

6-2010

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.

Keywords

Skyline query, Skyline query result update, Index, Search algorithm, Z-order space filling curve

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

VLDB Journal

Volume

19

Issue

3

First Page

333

Last Page

362

ISSN

1066-8888

Identifier

10.1007/s00778-009-0166-x

Publisher

Springer Verlag

Additional URL

http://dx.doi.org/10.1007/s00778-009-0166-x

Download

Share

COinS