Spatial skyline queries: exact and approximation algorithms

As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted the attention of researchers. Geographic information systems are a good example of an application using a massive amount of spatial data. Our goal is to efficiently support exact and approximate skyline queries over massive spatial datasets. A spatial skyline query, consisting of multiple query points, retrieves data points that are not father than any other data points, from all query points. To achieve this goal, we present a simple and efficient algorithm that computes the correct results, also propose a fast approximation algorithm that returns a desirable subset of the skyline results. In addition, we propose a continuous query algorithm to trace changes of skyline points while a query point moves. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison between our algorithms and the best known spatial skyline algorithms from several perspectives.

[1]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[2]  Nick Koudas,et al.  The design of a query monitoring system , 2009, TODS.

[3]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[4]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[5]  Anthony K. H. Tung,et al.  Finding k-dominant skylines in high dimensional space , 2006, SIGMOD Conference.

[6]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[7]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[8]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[9]  Cyrus Shahabi,et al.  The spatial skyline queries , 2006, VLDB.

[10]  Jarek Gryz,et al.  Maximal Vector Computation in Large Data Sets , 2005, VLDB.

[11]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[12]  Kyriakos Mouratidis,et al.  Aggregate nearest neighbor queries in spatial databases , 2005, TODS.

[13]  Yannis Manolopoulos,et al.  Fast Nearest-Neighbor Query Processing in Moving-Object Databases , 2003, GeoInformatica.

[14]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[15]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[16]  Beatrice Gralton,et al.  Washington DC - USA , 2008 .

[17]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[18]  Bernhard Seeger,et al.  An optimal and progressive algorithm for skyline queries , 2003, SIGMOD '03.

[19]  Christian S. Jensen,et al.  In-Route Skyline Querying for Location-Based Services , 2004, W2GIS.

[20]  Beng Chin Ooi,et al.  Efficient Progressive Skyline Computation , 2001, VLDB.

[21]  Setsuo Ohsuga,et al.  INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .

[22]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.

[23]  Anthony K. H. Tung,et al.  On High Dimensional Skylines , 2006, EDBT.

[24]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[25]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[26]  Seung-won Hwang,et al.  Continuous Skylining on Volatile Moving Data , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[27]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[28]  V. Klee.  On the complexity ofd- dimensional Voronoi diagrams , 1979 .

[29]  Cyrus Shahabi,et al.  Processing spatial skyline queries in both vector spaces and spatial network databases , 2009, TODS.

[30]  Bernard Chazelle,et al.  An optimal convex hull algorithm and new results on cuttings , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[31]  Donald Kossmann,et al.  Shooting Stars in the Sky: An Online Algorithm for Skyline Queries , 2002, VLDB.

[32]  Xuemin Lin,et al.  Selecting Stars: The k Most Representative Skyline Operator , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[33]  Anthony K. H. Tung,et al.  Continuous Skyline Queries for Moving Objects , 2006, IEEE Transactions on Knowledge and Data Engineering.

[34]  Christian Böhm,et al.  A cost model for nearest neighbor search in high-dimensional data space , 1997, PODS.