Skip to main content
SpringerLink
Log in

CuttingPlane: An Efficient Algorithm for Three-Dimensional Spatial Skyline Queries Based on Dynamic Scan Theory

  • Conference paper
Web Information Systems and Mining (WISM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6988))

Included in the following conference series:

  • 1294 Accesses

Abstract

Skyline operator and skyline computation play an important role in database communication, decision support, data visualization, spatial database and so on. In this paper we firstly analyze the existing methods, point out some problems in progressive disposal, query efficiency and convenience of following user selection. Secondly, we propose and prove a theorem for pruning query space based on dynamic scan theorem, based on the thought of the theorem, we propose a more efficient algorithm-dynamic cutting plane scan queries for skyline queries, and analyze and verify the feasibility, efficiency and veracity of the algorithm through instance and experiment.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

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

    Google Scholar 

  2. Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. IEEE Conf. on Data Engineering, Heidelberg, Germany (2001)

    Google Scholar 

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

    MATH  Google Scholar 

  4. Kung, H., Luccio, F., Preparata, F.: On Finding the Maxima of a Set of Vectors. Journal of the ACM 22(4) (1975)

    Google Scholar 

  5. Stojmenovic, I., Miyakawa, M.: An Optimal Parallel Algorithm for Solving the Maximal Elements Problem in the Plane. Parallel Computing 7(2) (1988)

    Google Scholar 

  6. Matousek, J.: Computing Dominances in En. Information Processing Letters 38(5) (1991)

    Google Scholar 

  7. McLain, D.: Drawing Contours from Arbitrary Data Points. Computer Journal 17(4) (1974)

    Google Scholar 

  8. Borzsonyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: ICDE (2001)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Guttman, A.: R-Tree a dynamic index structure for special search. In: Proc. ACM SIGMOD, pp. 47-57 (1984)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Yanshan University, Qinhuangdao, 066004, China

    Meng Zhao & Jing Yu

Authors
  1. Meng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Inforamtion Science, University of Macau, Av. Padre Tomás Pereira, Taipa, Macau, China

    Zhiguo Gong

  2. School of Computer, Shanghai University, 200444, Shanghai, China

    Xiangfeng Luo

  3. College of Computer and Software, Taiyuan University of Technology, 030024, Taiyuan, China

    Junjie Chen

  4. School of Computer and Information Engineering, Shanghai University of Electric Power, 200090, Shanghai, China

    Jingsheng Lei

  5. Department of Business Administration, Caritas Institute of Higher Education, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, M., Yu, J. (2011). CuttingPlane: An Efficient Algorithm for Three-Dimensional Spatial Skyline Queries Based on Dynamic Scan Theory. In: Gong, Z., Luo, X., Chen, J., Lei, J., Wang, F.L. (eds) Web Information Systems and Mining. WISM 2011. Lecture Notes in Computer Science, vol 6988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23982-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23982-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23981-6

  • Online ISBN: 978-3-642-23982-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation