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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Lu, H. X., Luo, Y., & Lin, X. (2003). An optimal divide-conquer algorithm for 2D skyline queries. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2798, 46–60. https://doi.org/10.1007/978-3-540-39403-7_6
Mendeley helps you to discover research relevant for your work.