Limiting distributions for the costs of partial match retrievals in multidimensional tries

Random Structures and Algorithms

Volumn 17, Issue 3-4, 2000, Pages 428-459

  Schachinger, Werner ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

K d trie; Limit theorems; Multidimensional data; Partial match retrieval; Recursive algorithms; Trie

Indexed keywords

EID: 0039031027     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200010/12)17:3/4<428::AID-RSA12>3.0.CO;2-6     Document Type: Article

References (25)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1970.
2. P. Billingsley, Probability and Measure, 3rd ed., Wiley, New York, 1995.
3. J.L. Bentley, Multidimensional binary search trees used for associative retrieval, Commun ACM 18(9), (1975), 509-517.
4. W.A. Burkhard, Hashing and trie algorithms for partial match retrieval, ACM Trans Database Systems 1(2) (1976), 175-187.
5. A. Duch, V. Estivill-Castro, and C. Martinez, Randomized k-dimensional binary search trees, Technical Report LSI-98-48-R, LSI-UPC (1998).
6. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoret Comput Sci 144 (1995), 3-58.
7. P. Flajolet and C. Puech, Partial match retrieval of multidimensional data, J ACM 33 (1986), 371-407.
8. E. Fredkin, Trie memory, CACM 3 (1960), 490-500.
9. P. Henrici, Applied and Computational Complex Analysis, Vol. 2, Wiley, New York, 1977.
10. P. Jacquet and M. Régnier, Normal limiting distribution of the size of tries, Proc. Performance 87 (1988), pp. 209-223.
11. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, Multidimensional digital searching and some new parameters in tries, Internat J Found Comput Sci 4 (1993), 69-84.
12. D.E. Knuth, The art of computer programming, Vol. 3, Addison-Wesley, Reading MA, (1973).
13. H.M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
14. C. Martinez, A. Panholzer, and H. Prodinger, Partial match queries in relaxed multidimensional search trees, Algorithmica (2000), to appear.
15. R. Neininger, Asymptotic distributions for partial match queries in K-d trees, Random Structures Algorithms (2000), to appear.
16. R. Neininger and L. Rüschendorf, Limit laws for partial match queries in quadtrees, Preprint (1999).
17. S. Roura, An improved Master theorem for divide-and-conquer recurrences, in Proc. of the 24th International Colloquium (ICALP-97) Springer, New York, (1997) pp. 449-459
18. S.T. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Adv Appl Prob 27 (1995), 770-799.
19. R.L. Rivest, Partial-match retrieval algorithms, SIAM J Comput 5 (1976) 19-50.
20. U. Rösler, A limit theorem for "Quicksort" RAIRO, Theoret Inform Appl 25 (1991), 85-100.
21. U. Rösler, A fixed point theorem for distributions, Stochastic Process Appl 42 (1992), 195-214.
22. U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica (2000), to appear.
23. W. Schachinger, On the variance of a class of inductive valuations of data structures for digital search, Theoret Comput Sci 144 (1995), 251-275.
24. W. Schachinger, The variance of a partial match retrieval in a multidimensional symmetric trie, Random Structures Algorithms 7/1 (1995), 81-95.
25. R. Schnabl, Über eine C∞-Funktion, Zahlentheoretische Analysis, Wiener Seminarber, 1980-82, Lect. Notes Math. 1114, 1985, pp. 134-142.