On the average performance of orthogonal range search in multidimensional data structures

Journal of Algorithms

Volumn 44, Issue 1, 2002, Pages 226-245

  Duch, Amalia ^a   Martínez, Conrado ^b  

^a National Laboratory of Advanced Informatics Xalapa   (Mexico)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Average case analysis; K d trees; Multidimensional data structures; Multidimensional search; Orthogonal range search; Partial match search; Quadtrees

Indexed keywords

CURVE FITTING; DATA REDUCTION; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS);

MULTIDIMENSIONAL DATA STRUCTURES;

DATA STRUCTURES;

EID: 0036660153     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00213-4     Document Type: Article

References (17)

1. J.L. Bentley, Multidimensional binary search trees used for associative retrieval, Comm. ACM 18 (9) (1975) 509-517.
2. J.L. Bentley, R.A. Finkel, Quad trees: A data structure for retrieval on composites keys, Acta Inform. 4 (1974) 1-9.
3. J.L. Bentley, J.H. Friedman, Data structures for range searching, ACM Comput. Surv. 11 (4) (1979) 397-409.
4. J.L. Bentley, D.F. Stanat, Analysis of range searches in quad trees, Inform. Process. Lett. 3 (6) (1975) 170-173.
5. P. Chanzy, L. Devroye, C. Zamora-Cura, Analysis of range search for random K-d trees, Acta Inform. 37 (2001) 355-383.
6. W. Cunto, G. Lau, Ph. Flajolet, Analysis of kdt-trees: Kd-trees improved by local reorganisations, in: F. Dehne, J.-R. Sack, N. Santoro (Eds.), Workshop on Algorithms and Data Structures (WADS'89), Lecture Notes in Comput. Sci., Vol. 382, Springer, 1989, pp. 24-38.
7. L. Devroye, J. Jabbour, C. Zamora-Cura, Squarish k-d trees, SIAM J. Comput. 30 (2000) 1678-1700.
8. A. Duch, V. Estivill-Castro, C. Martínez, Randomized k-dimensional binary search trees, in: K.-Y. Chwa, O.H. Ibarra (Eds.), Int. Symposium on Algorithms and Computation (ISAAC'98), Lecture Notes in Comput. Sci., Vol. 1533, Springer, 1998, pp. 199-208.
9. A. Duch, C. Martínez, On the average performance of orthogonal range search in multidimensional data structures, in: Proc. of the 29th Int. Coloq. on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci., Springer, 2002, accepted.
10. Ph. Flajolet, G. Gonnet, C. Puech, J.M. Robson, Analytic variations on quadtrees, Algorithmica 10 (1993) 473-500.
11. Ph. Flajolet, C. Puech, Partial match retrieval of multidimensional data, J. ACM 33 (2) (1986) 371-407.
12. P. Kirschenhofer, H. Prodinger, Multidimensional digital searching-alternative data structures, Random Structures and Algorithms 5 (1) (1994) 123-134.
13. H.M. Mahmoud, Evolution of Random Search Trees, Wiley, 1992.
14. C. Martínez, A. Panholzer, H. Prodinger, Partial match queries in relaxed multidimensional search trees, Algorithmica 29 (12) (2001) 181-204.
15. R.L. Rivest, Partial-match retrieval algorithms, SIAM J. Comput. 5 (1) (1976) 19-50.
16. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
17. Y.V. Silva-Filho, Average case analysis of region search in balanced k-d trees, Inform. Process. Lett. 8 (5) (1979) 219-223.