Space-efficient and fast algorithms for multidimensional dominance reporting and counting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 558-568

  Jaja, Joseph ^a   Mortensen, Christian W ^b   Shi, Qingmin ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SEARCH ENGINES; INFORMATION THEORY;

2 - DIMENSIONAL; 3-DIMENSIONAL; COUNTING PROBLEMS; FAST ALGORITHMS; INFORMATION THEORETIC BOUNDS; LINEAR SPACES; QUERY TIME; RAM MODEL; SPACE EFFICIENT ALGORITHMS; SPACE EFFICIENT;

INFORMATION THEORY; SEARCH ENGINES;

EID: 29344474996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_49     Document Type: Article

References (14)

1. [ABR00] Stephen Alstrup, Gerth Støling Brodal, and Theis Rauhe. New data structures for orthogonal range searching. In Proceedings of IEEE Symposium on Foundations of Computer Science, pages 198-207, Redondo Beach, CA, 2000.
2. [AGKR02] S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe. Nearest common ancestors: A survey and a new distributed algorithm. In Proceedings of the 14th ACM Symp. on Parallel Algorithms and Architecture (SPAA), pages 258-264, August 2002.
3. [Ben80] Jon Louis Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214-229, April 1980.
4. [CE87] Bernard Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom., 3:113-126, 1987.
5. [CG86] Bernard Chazelle and Leonidas J. Guibas. Fractional Cascading: I. A data structure technique. Algorithmica, 1(2):133-162, 1986.
6. [Cha88] Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-463, June 1988.
7. [EO82] H. Edelsbrunner and M.H. Overmars. On the equivalence of some rectangle problems. Information Processing Letters, 14:124-127, 1982.
8. [FW93] Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
9. [FW94] Michael L. Fredman and Dan E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
10. [GAA03] Sathish Govindarajan, Pankaj K. Agarwal, and Lars Arge. CRB-Tree: an efficient indexing scheme for range-aggregate queries. In Proceedings of the 9th International Conference on Database Theory, Siena, Italy, 2003.
11. [Mor03] Christian Worm Mortensen. Fully-dynamic orthogonal range reporting on RAM (Preliminary version). Technical Report TR-2003-22, The IT University of Copenhagen, 2003.
12. [MT98] C. Makris and A. K. Tsakalidis. Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters, 66(6):277-283, 1998.
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.
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.