Skip to main content
SpringerLink
Log in

Spatial skyline queries: exact and approximation algorithms

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

Notes

  1. Available at http://www.cs.fsu.edu/~lifeifei/SpatialDataset.htm

References

  1. Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. J ACM 22(4):469–476

    Article  Google Scholar 

  2. Börzsönyi S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE ’01: Proceedings of the 17th international conference on data engineering. Washington, DC, USA. IEEE Computer Society, New York, pp 421–430

  3. Tan K-L, Eng P-K, Ooi BC (2001) Efficient progressive skyline computation. In: VLDB ’01: Proceedings of the 27th international conference on very large data bases. San Francisco, CA, USA. Morgan Kaufmann, San Mateo, pp 301–310

  4. Papadias D, Tao Y, Fu G, Seeger B (2003) An optimal and progressive algorithm for skyline queries. In: SIGMOD ’03: Proceedings of the 2003 ACM SIGMOD international conference on management of data. New York, NY, USA. ACM, New York, pp 467–478

  5. Chomicki J, Godfery P, Gryz J, Liang D (2003) Skyline with presorting. In: ICDE ’03: Proceedings of the 19th international conference on data engineering. IEEE Computer Society, New York, pp 717–816

    Google Scholar 

  6. Sharifzadeh M, Shahabi C (2006) The spatial skyline queries. In: VLDB ’06: Proceedings of the 32nd international conference on very large data bases. VLDB Endowment, pp 751–762

  7. Sharifzadeh M, Shahabi C, Kazemi L (2009) Processing spatial skyline queries in both vector spaces and spatial network databases. ACM Trans Database Syst 34(3):1–45

    Article  Google Scholar 

  8. Lin X, Yuan Y, Zhang Q, Zhang Y (2007) Selecting stars: the k most representative skyline operator. In: ICDE ’07: Proceedings of the 23rd international conference on data engineering, pp 86–95

  9. Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: VLDB ’02: Proceedings of the 28th international conference on very large data bases. VLDB Endowment, pp 275–286

  10. Godfrey P, Shipley R, Gryz J (2005) Maximal vector computation in large data sets. In VLDB ’05: Proceedings of the 31st international conference on very large data bases. VLDB Endowment, pp 229–240

  11. Chan CY, Jagadish HV, Tan K-L, Tung AKH, Zhang Z (2006) On high dimensional skylines. In: EDBT ’06: Proceedings of the 10th international conference on extending database technology, pp 478–495

  12. Chan C-Y, Jagadish HV, Tan K-L, Tung AKH, Zhang Z (2006) Finding k-dominant skylines in high dimensional space. In: SIGMOD ’06: Proceedings of the 2006 ACM SIGMOD international conference on management of data. New York, NY, USA. ACM, New York, pp 503–514

  13. Huang Z, Lu H, Ooi BC, Tung AKH (2006) Continuous skyline queries for moving objects. IEEE Trans Knowl Data Eng 18(12):1645–1658

    Article  Google Scholar 

  14. Lee M-W, Hwang S-w (2009) Continuous skylining on volatile moving data. In: ICDE ’09: Proceedings of the 2009 IEEE international conference on data engineering. Washington, DC, USA. IEEE Computer Society, New York, pp 1568–1575

  15. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. SIGMOD Rec 24(2):71–79

    Article  Google Scholar 

  16. Berchtold S, Böhm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: PODS ’97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. New York, NY, USA. ACM, New York, pp 78–86

  17. Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is “nearest neighbor” meaningful? In: ICDT ’99: Proceedings of the 7th international conference on database theory. London, UK. Springer, Berlin, pp 217–235

  18. Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: SSTD ’01: Proceedings of the 7th international symposium on advances in spatial and temporal databases. London, UK. Springer, Berlin, pp 79–96

  19. Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. In: IDEAS ’02: Proceedings of the 2002 international symposium on database engineering & applications. Washington, DC, USA. IEEE Computer Society, New York, pp 44–53

  20. Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: VLDB ’02: Proceedings of the 28th international conference on very large data bases. VLDB Endowment, pp 287–298

  21. Raptopoulou K, Papadopoulos AN, Manolopoulos Y (2003) Fast nearest-neighbor query processing in moving-object databases. Geoinformatica 7(2):113–137

    Article  Google Scholar 

  22. Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst 30(2):529–576

    Article  Google Scholar 

  23. Huang X, Jensen CS (2004) In-route skyline querying for location-based services. In: Proceedings of the international workshop on web and wireless geographical information systems (W2GIS), pp 120–135

  24. de Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin

    Google Scholar 

  25. Bentley JL, Kung HT, Schkolnick M, Thompson CD (1978) On the average number of maxima in a set of vectors and applications. J ACM 25(4):536–543

    Article  Google Scholar 

  26. Rockafellar RT (1996) Convex analysis. Princeton University Press, Princeton

    Google Scholar 

  27. Matoušek J (2002) Lectures on discrete geometry. Springer, Berlin

    Google Scholar 

  28. Barber B (1995) Qhull code for convex hull, delaunay triangulation, voronoi diagram, and halfspace intersection about a point. http://www.qhull.org/

  29. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec 19(2):322–331

    Article  Google Scholar 

  30. Klee V (1980) On the complexity of d-dimensional Voronoi diagrams. Arch Math 34:75–80

    Article  Google Scholar 

  31. Chazelle B (1991) An optimal convex hull algorithm and new results on cuttings (extended abstract). In: SFCS ’91: Proceedings of the 32nd annual symposium on foundations of computer science. Washington, DC, USA. IEEE Computer Society, New York, pp 29–38

  32. Clarkson KL, Shor PW (1989) Applications of random sampling in computational geometry, II. Discrete Comput Geom 4(5):387–421

    Article  Google Scholar 

  33. Seidel R (1991) Small-dimensional linear programming and convex hulls made easy. Discrete Comput Geom 6(5):423–434

    Article  Google Scholar 

Download references

Acknowledgement

This research was supported by the National IT Industry Promotion Agency (NIPA) under the program of Software Engineering Technologies Development.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Republic of Korea

    Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn & Seung-won Hwang

Authors
  1. Mu-Woong Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wanbin Son
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hee-Kap Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seung-won Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seung-won Hwang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, MW., Son, W., Ahn, HK. et al. Spatial skyline queries: exact and approximation algorithms. Geoinformatica 15, 665–697 (2011). https://doi.org/10.1007/s10707-010-0119-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-010-0119-y

Keywords

Search

Navigation