Output-sensitive skyline algorithms in external memory

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 887-900

  Hu, Xiaocheng ^a   Sheng, Cheng ^a   Tao, Yufei ^a,b   Yang, Yi ^c   Zhou, Shuigeng ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^c FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

D-DIMENSIONAL SPACES; DETERMINISTIC ALGORITHMS; EXPECTED COSTS; EXTERNAL MEMORY; ORDERED DOMAINS; OUTPUT-SENSITIVE; SIDE PRODUCTS; STATE OF THE ART;

ALGORITHMS;

EID: 84876031572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.64     Document Type: Conference Paper

References (15)

1. P. K. Agarwal, G. Cormode, Z. Huang, J. M. Phillips, Z. Wei, and K. Yi. Mergeable summaries. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 23-34, 2012.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM (CACM), 31(9):1116-1127, 1988.
3. L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Algorithms and Data Structures Workshop (WADS), pages 83-94, 1993.
4. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM (CACM), 23(4):214-229, 1980.
5. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences (JCSS), 7(4):448-461, 1973.
6. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16(4):361-368, 1996.
7. T. M. Chan, K. G. Larsen, and M. Patrascu. Orthogonal range searching on the ram, revisited. In Symposium on Computational Geometry (SoCG), pages 1-10, 2011.
8. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 135-143, 1984.
9. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 714-723, 1993.
10. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proceedings of ACM Management of Data (SIGMOD), pages 58-66, 2001.
11. D. G. Kirkpatrick and R. Seidel. Output-size sensitive algorithms for finding maximal vectors. In Symposium on Computational Geometry (SoCG), pages 89-96, 1985.
12. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of the ACM (JACM), 22(4):469-476, 1975.
13. A. D. Sarma, A. Lall, D. Nanongkai, and J. Xu. Randomized multi-pass streaming skyline algorithms. Proceedings of the VLDB Endowment (PVLDB), 2(1):85-96, 2009.
14. C. Sheng and Y. Tao. Finding skylines in external memory. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 107-116, 2011.
15. Z. Zhang, Y. Yang, R. Cai, D. Papadias, and A. K. H. Tung. Kernel-based skyline cardinality estimation. In Proceedings of ACM Management of Data (SIGMOD), pages 509-522, 2009.