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

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

Volumn 2380 LNCS, Issue , 2002, Pages 514-524

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

^a National Laboratory of Advanced Informatics Xalapa   (Mexico)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ASYMPTOTIC ESTIMATES; AVERAGE-CASE ANALYSIS; EXPECTED COSTS; LOWER AND UPPER BOUNDS; MULTIDIMENSIONAL DATA STRUCTURE; ORTHOGONAL RANGE SEARCH; PARTIAL MATCHES; SUITABLE CONDITIONS;

DATA STRUCTURES;

EID: 84869193524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_44     Document Type: Conference Paper

References (16)

1. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990)
2. Bentley, J., Friedman, J.: Data structures for range searching. ACM Computing Surveys 11 (1979) 397-409
3. Bentley, J.: Multidimensional binary search trees used for associative retrieval. Communications of the ACM 18 (1975) 509-517
4. Bentley, J., Finkel, R.: Quad trees: A data structure for retrieval on composites keys. Acta Informatica 4 (1974) 1-(1)
5. Rivest, R.L.: Partial-match retrieval algorithms. SIAM Journal on Computing 5 (1976) 19-50
6. Bentley, J., Stanat, D.: Analysis of range searches in quad trees. Information Processing Letters 3 (1975) 170-173
7. Silva-Filho, Y.: Average case analysis of region search in balanced κ-d trees. Information Processing Letters 8 (1979) 219-223
8. Chanzy, P., Devroye, L., Zamora-Cura, C.: Analysis of range search for random κ-d trees. Acta Informatica 37 (2001) 355-383
9. Devroye, L., Jabbour, J., Zamora-Cura, C.: Squarish κ-d trees. SIAM Journal on Computing 30 (2000) 1678-1700
10. Duch, A., Estivill-Castro, V., Martínez, C.: Randomized κ-dimensional binary search trees. In Chwa, K.Y., Ibarra, O.H., eds.: Int. Symposium on Algorithms and Computation (ISAAC'98). Volume 1533 of Lecture Notes in Comput. Sci., Springer (1998) 199-208
11. Duch, A., Martínez, C.: On the average performance of orthogonal range search in multidimensional data structures. Technical Report ALCOMFT-TR-01-185, ALCOM-FT (2001) Also published as technical report LSI-01-54-R, LSI-UPC. Available from http://www.brics.dk/~alcomft/TR/ALCOMFT-TR- 01-185.ps and http://www.lsi.upc.es/~techreps/ps/R01-54.ps.gz.
12. Mahmoud, H.: Evolution of Random Search Trees. J. Wiley & Sons (1992)
13. Martínez, C., Panholzer, A., Prodinger, H.: Partial match queries in relaxed multidimensional search trees. Algorithmica 29 (2001) 181-204
14. Cunto, W., Lau, G., Flajolet, P.: Analysis of κdτ-trees: κd-trees improved by local reorganisations. In Dehne, F., Sack, J.R., Santoro, N., eds.: Workshop on Algorithms and Data Structures (WADS'89). Volume 382 of Lecture Notes in Comput. Sci., Springer-Verlag (1989) 24-38
15. Flajolet, P., Puech., C.: Partial match retrieval of multidimensional data. Journal of the ACM 33 (1986) 371-407
16. Flajolet, P., Gonnet, G., Puech, C., Robson, J.M.: Analytic variations on quadtrees. Algorithmica 10 (1993) 473-500