Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

  • Joseph JaJa
  • Christian W. Mortensen
  • Qingmin Shi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3341)

Abstract

We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. “Surpassing the information theoretic bound with fusion trees”, Journal of Computer and System Sciences, 47:424–436, 1993], our algorithms achieve O(log n/loglog n+f) query time for the 3-dimensional dominance reporting problem, where f is the output size, and O(log n/loglog n) query time for the 2-dimensional dominance counting problem. We extend these results to any constant dimension d ≥ 3, achieving O(n(log n/loglog n)d − 3) space and O((log n/loglog n)d − 2+ f) query time for the reporting case and O(n(log n/loglog n)d − 2) space and O((log n/loglog n)d − 1) query time for the counting case.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABR00]
    Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proceedings of IEEE Symposium on Foundations of Computer Science, Redondo Beach, pp. 198–207 (2000)Google Scholar
  2. [AGKR02]
    Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proceedings of the 14th ACM Symp. on Parallel Algorithms and Architecture (SPAA), August, pp. 258–264 (2002)Google Scholar
  3. [Ben80]
    Bentley, J.L.: Jon Louis Bentley. Multidimensional divide-and-conquer. Communications of the ACM 23(4), 214–229 (1980)MATHMathSciNetCrossRefGoogle Scholar
  4. [CE87]
    Chazelle, B., Edelsbrunner, H.: Bernard Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom. 3, 113–126 (1987)MathSciNetCrossRefGoogle Scholar
  5. [CG86]
    Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A data structure technique. Algorithmica 1(2), 133–162 (1986)MATHMathSciNetCrossRefGoogle Scholar
  6. [Cha88]
    Chazelle, B.: Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17(3), 427–463 (1988)MATHMathSciNetCrossRefGoogle Scholar
  7. [EO82]
    Edelsbrunner, H., Overmars, M.H.: On the equivalence of some rectangle problems. Information Processing Letters 14, 124–127 (1982)MATHMathSciNetCrossRefGoogle Scholar
  8. [FW93]
    Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences 47, 424–436 (1993)MATHMathSciNetCrossRefGoogle Scholar
  9. [FW94]
    Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48, 533–551 (1994)MATHMathSciNetCrossRefGoogle Scholar
  10. [GAA03]
    Govindarajan, S., Agarwal, P.K., Arge, L.: CRB-Tree: an efficient indexing scheme for range-aggregate queries. In: Proceedings of the 9th International Conference on Database Theory, Siena, Italy (2003)Google Scholar
  11. [Mor03]
    Mortensen, C.W.: Fully-dynamic orthogonal range reporting on RAM (Preliminary version). Technical Report TR-2003-22, The IT University of Copenhagen (2003)Google Scholar
  12. [MT98]
    Makris, C., Tsakalidis, A.K.: Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters 66(6), 277–283 (1998)MATHMathSciNetCrossRefGoogle Scholar
  13. [SJ03a]
    Qingmin Shi and Joseph JaJa. Fast algorithms for 3-d dominance reporting and counting. Technical Report CS-TR-4437, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)Google Scholar
  14. [SJ03b]
    Qingmin Shi and Joseph JaJa. Fast fractional cascading and its applications. Technical Report CS-TR-4502, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Joseph JaJa
    • 1
  • Christian W. Mortensen
    • 2
  • Qingmin Shi
    • 1
  1. 1.Institute of Advanced Computer StudiesUniversity of MarylandCollege ParkUSA
  2. 2.IT University of CopenhagenKøbenhavn SDenmark

Personalised recommendations