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

  • Meng Zhao
  • Jing Yu
Conference paper

DOI: 10.1007/978-3-642-23982-3_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6988)
Cite this paper as:
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

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.

Keywords

skyline dominate dynamic scan 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Meng Zhao
    • 1
  • Jing Yu
    • 1
  1. 1.Department of Computer Science and TechnologyYanshan UniversityQinhuangdaoChina

Personalised recommendations