Abstract
As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted attention. Geographic information systems are such an application with massive spatial data. Our goal is to efficiently support skyline queries over massive spatial data. To achieve this goal, we first observe that the best known algorithm VS 2, despite its claim, may fail to deliver correct results. In contrast, we present a simple and efficient algorithm that computes the correct results. To validate the effectiveness and efficiency of our algorithm, we provide an extensive empirical comparison of our algorithm and VS 2 in several aspects.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kung, H.T., Luccio, F., Preparata, F.: On finding the maxima of a set of vectors. Journal of the Association for Computing Machinery 22(4), 469–476 (1975)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE 2001: Proc. of the 17th International Conference on Data Engineering, p. 421 (2001)
Tan, K., Eng, P., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB 2001: Proc. of the 27th International Conference on Very Large Data Bases, pp. 301–310 (2001)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD 2003: Proc. of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467–478 (2003)
Chomicki, J., Godfery, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE 2007: Proc. of the 23rd International Conference on Data Engineering (2007)
Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB 2006: Proc. of the 32nd International Conference on Very Large Data Bases, pp. 751–762 (2006)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB 2002: Proc. of the 28th International Conference on Very Large Data Bases, pp. 275–286 (2002)
Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: VLDB 2005: Proc. of the 31st International Conference on Very Large Data Bases, pp. 229–240 (2005)
Chan, C.Y., Jagadish, H., Tan, K., Tung, A.K., Zhang, Z.: On high dimensional skylines. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 478–495. Springer, Heidelberg (2006)
Chan, C.Y., Jagadish, H., Tan, K.L., Tung, A.K., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: SIGMOD 2006: Proc. of the 2006 ACM SIGMOD International Conference on Management of Data (2006)
Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: ICDE 2007: Proc. of the 23rd International Conference on Data Engineering, pp. 86–95 (2007)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD 1995: Proc. of the 1995 ACM SIGMOD international conference on Management of data, pp. 71–79 (1995)
Berchtold, S., Böhm, C., Keim, D.A., Kriegel, H.P.: A cost model for nearest neighbor search in high-dimensional data space. In: PODS 1997: Proc. of the 16th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 78–86 (1997)
Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217–235. Springer, Heidelberg (1998)
Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems 30(2), 529–576 (2005)
Huang, X., Jensen, C.S.: In-route skyline querying for location-based services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 120–135. Springer, Heidelberg (2005)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)
Qhull code for convex hull, delaunay triangulation, voronoi diagram, and halfspace intersection about a point. World Wide Web electronic publication (May 1995), http://www.qhull.org/
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD 1990: Proc. of the 1990 ACM SIGMOD international conference on Management of data, pp. 322–331 (1990)
Klee, V.: On the complexity of d-dimensional Voronoi diagrams. Archiv der Mathematik 34, 75–80 (1980)
Chazelle, B.: An optimal convex hull algorithm and new results on cuttings. In: Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 29–38 (1991)
Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. II. Discrete Comput. Geom. 4, 387–421 (1989)
Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6, 423–434 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, W., Lee, MW., Ahn, HK., Hwang, Sw. (2009). Spatial Skyline Queries: An Efficient Geometric Algorithm. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)