Skip to main content
Springer Nature Link
Log in

An Optimal Divide-Conquer Algorithm for 2D Skyline Queries

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2798))

Abstract

Skyline query processing is fundamental to many applications including multi-criteria decision making. In this paper, we will present an optimal algorithm for computing skyline in the two dimensional space. The algorithm has the progressive nature and adopts the divide-conquer paradigm. It can be shown that our algorithm achieves the minimum I/O costs, and is more efficient and scalable than the existing techniques. The experiment results demonstrated that our algorithm greatly improves the performance of the existing techniques.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: International Conference on Data Engineering ICDE (2001)

    Google Scholar 

  2. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD (1990)

    Google Scholar 

  3. Ferhatosmanoglu, H., Stanoi, I., Agrawal, D.P., El Abbadi, A.: Constrained Nearest Neighbor Queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 257. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Gaede, V., Gunther, O.: Multidimentional Access Methods. Computing Surveys 30(2), 170–231 (1998)

    Article  Google Scholar 

  5. Hjaltason, G., Samet, H.: Distance Browsing in Spatial Databases. ACM TODS 24(2), 265–318 (1999)

    Article  Google Scholar 

  6. Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maximum of a set of vectors. Journal of the ACM 22(4), 469–476 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. VLDB 2002 (2002)

    Google Scholar 

  8. Hadjieleftheriou, M.: Spatial Index Library (2002), http://www.cs.ucr.edu/marioh/spatialindex/index.html

  9. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)

    Google Scholar 

  10. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An Optimal Progressive Alogrithm for Skyline Queries. SIGMOD (2003)

    Google Scholar 

  11. Roussopoulos, N., Kelly, S., Vincent, F.: Nearest Neighbor Queries. SIGMOD (1995)

    Google Scholar 

  12. Steuer, R.: Multiple Criteria Optimization. Wiley, New York (1986)

    MATH  Google Scholar 

  13. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: VLDB (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science & Engineering, University of New South Wales, Sydney, NSW 2052, Australia

    Hai-Xin Lu, Yi Luo & Xuemin Lin

Authors
  1. Hai-Xin Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xuemin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics Problems, Russian Academy of Science,  

    Leonid Kalinichenko

  2. Institute of Computer Science III, University of Bonn, Roemerstr. 164, D-53117, Bonn, Germany

    Rainer Manthey

  3. Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

  4. Department of InformationTechnology/Mathematics, University ofApplied Sciences, Friedrich-List-Platz 1, 01069, Dresden, Germany

    Uwe Wloka

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, HX., Luo, Y., Lin, X. (2003). An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. In: Kalinichenko, L., Manthey, R., Thalheim, B., Wloka, U. (eds) Advances in Databases and Information Systems. ADBIS 2003. Lecture Notes in Computer Science, vol 2798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39403-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39403-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20047-5

  • Online ISBN: 978-3-540-39403-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics