CuttingPlane: An efficient algorithm for three-dimensional spatial skyline queries based on dynamic scan theory

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Zhao, M., & Yu, J. (2011). CuttingPlane: An efficient algorithm for three-dimensional spatial skyline queries based on dynamic scan theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6988 LNCS, pp. 72–78). https://doi.org/10.1007/978-3-642-23982-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free