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

Authors:
Meng Zhao;Jing Yu
Affiliations:
Department of Computer Science and Technology, Yanshan University, Qinhuangdao, China;Department of Computer Science and Technology, Yanshan University, Qinhuangdao, China
Venue:
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part II
Year:
2011

Citing 7
Cited 0

Computing dominances inEn (short communication)

Information Processing Letters
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation

Proceedings of the 27th International Conference on Very Large Data Bases
Shooting stars in the sky: an online algorithm for skyline queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

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.