论文信息 - Faster output-sensitive skyline computation algorithm

Faster output-sensitive skyline computation algorithm

We present the second output-sensitive skyline computation algorithm which is faster than the only existing output-sensitive skyline computation algorithm [1] in worst case because our algorithm does not rely on the existence of a linear time procedure for finding medians.

Xiaofeng Xu | Li Xiong | Jinfei Liu

[1] Kenneth L. Clarkson,et al. Fast linear expected-time algorithms for computing maxima and convex hulls , 1993, SODA '90.

[2] H. T. Kung,et al. On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[3] Timothy M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions , 1996, Discret. Comput. Geom..

[4] Timothy M. Chan,et al. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures , 2014, Discrete & Computational Geometry.

[5] David G. Kirkpatrick,et al. Output-size sensitive algorithms for finding maximal vectors , 1985, SCG '85.

[6] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[7] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.

[8] Yi Yang,et al. Output-sensitive Skyline Algorithms in External Memory , 2013, SODA.