Universal asymptotics for random tries and PATRICIA trees

Algorithmica (New York)

Volumn 42, Issue 1, 2005, Pages 11-29

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Keywords and phrases

Indexed keywords

ASYMPTOTIC STABILITY; DATA STRUCTURES; DATABASE SYSTEMS; INTEGER PROGRAMMING; ITERATIVE METHODS; MAPPING; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY; VECTORS;

CONCENTRATION INEQUALITY; HEIGHT OF A TREE; LAW OF LARGE NUMBERS; PATRICIA TREES; PROBABILISTIC ANALYSIS; TRIE;

TREES (MATHEMATICS);

EID: 17444409571     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1137-7     Document Type: Article

References (68)

1. D. Aldous and P. Shields (1988), A diffusion limit for a class of randomly-growing binary trees, Probability Theory and Related Fields, vol. 79, pp. 509-542.
2. K. Azuma (1967), Weighted sums of certain dependent random variables, Tohoku Mathematical Journal, vol. 37, pp. 357-367.
3. J. L. Bentley and W. A. Burkhard (1976), Heuristics for partial-match retrieval in database design, Information Processing Letters, vol. 4, no. 5, pp. 132-135.
4. S. Boucheron, G. Lugosi, and P. Massart (2000), A sharp concentration inequality with applications in random combinatorics and learning, Random Structures and Algorithms, vol. 16, pp. 277-292.
5. S. Boucheron, G. Lugosi, and P. Massart (2003), Concentration inequalities using the entropy method, The Annals of Probability, vol. 31, pp. 1583-1614.
6. J. Bourdon (2001), Size and path length of Patricia tries: dynamical sources context, Random Structures and Algorithms, vol. 19, pp. 289-315.
7. J. Bourdon (2002), Analyse dynamique d'algorithmes: exemples en arithmétique et en théorie de l'information, Thèse de doctorat, Université de Caen Basse-Normandie.
8. J. Bourdon, M. Nebel, and B. Vallée (2001), On the stack size of general tries, Theoretical Informatics and Applications, vol. 35, pp. 163-185.
9. J. Clément, P. Flajolet, and B. Vallée (1998), The analysis of hybrid trie structures, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1998), pp. 531-539, ACM, New York.
10. J. Clément, P. Flajolet, and B. Vallée (2001), Dynamical sources in information theory: a general analysis of trie structures, Algorithmica, vol. 29, pp. 307-369.
11. L. Devroye (1984), A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Information, vol. 21, pp. 229-237.
12. L. Devroye (1985), The expected length of the longest probe sequence when the distribution is not uniform, Journal of Algorithms, vol. 6, pp. 1-9.
13. L. Devroye (1992a), A note on the probabilistic analysis of PATRICIA trees, Random Structures and Algorithms, vol. 3, pp. 203-214.
14. L. Devroye (1992b), A study of trie-like structures under the density model, Annals of Applied Probability, vol. 2, pp. 402-434.
15. L. Devroye (2002), Laws of large numbers and tail inequalities for random tries and Patricia trees, Journal of Computational and Applied Mathematics, vol. 142, pp. 27-37.
16. L. Devroye and C. Zamora-Cura (2004), Expected worst-case time for partial match in random quadtries, Discrete Applied Mathematics, vol. 141, pp. 103-117.
17. B. Efron and C. Stein (1981), The jackknife estimate of variance, Annals of Statistics, vol. 9, pp. 586-596.
18. P. Flajolet (1983), On the performance evaluation of extendible hashing and trie search, Acta Information, vol. 20, pp. 345-369.
19. P. Flajolet and C. Puech (1986), Tree structure for partial match retrieval, Journal of the ACM, vol. 33, pp. 371-407.
20. P. Flajolet and R. Sedgewick (1986), Digital search trees revisited, Siam Journal on Computing, vol. 15, pp. 748-767.
21. P. Flajolet and J. M. Steyaert (1982), A branching process arising in dynamic hashing, trie searching and polynomial factorization, in: Lecture Notes in Computer Science, vol. 140, pp. 239-251, Springer-Verlag, Berlin.
22. P. Flajolet and B. Vallée (1998), Continued fraction algorithms, functional operators, and structure constants, Theoretical Computer Science, vol. 194, pp. 1-34.
23. E. H. Fredkin (1960), Trie memory, Communications of the ACM, vol. 3, pp. 490-500.
24. G. H. Gonnet (1981), Expected length of the longest probe sequence in hash code searching, Journal of the ACM, vol. 28, pp. 289-304.
25. W. Hoeffding (1963), Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association, vol. 58, pp. 13-30.
26. P. Jacquet and M. Régnier (1986), Trie partitioning process: limiting distributions, in: CAAP 86 (edited by P. Franchi-Zannettacci), pp. 196-210, Lecture Notes in Computer Science, vol. 214, Springer-Verlag, Berlin.
27. P. Jacquet and M. Régnier (1989), Normal limiting distribution for the size and the external path length of tries, Technical Report, INRIA, Rocquencourt.
28. P. Jacquet and W. Szpankowski (1991), Analysis of digital tries with Markovian dependency, IEEE Transactions on Information Theory, vol. IT-37, pp. 1470-1475.
29. P. Kirschenhofer and H. Prodinger (1986), Some further results on digital trees, in: Lecture Notes in Computer Science, vol. 226, pp. 177-185, Springer-Verlag, Berlin.
30. P. Kirschenhofer, H. Prodinger, and W. Szpankowski (1989a), On the balance property of PATRICIA tries: external path length viewpoint, Theoretical Computer Science, vol. 68, pp. 1-17.
31. P. Kirschenhofer, H. Prodinger, and W. Szpankowski (1989b), On the variance of the external path length in a symmetric digital trie, Discrete Applied Mathematics, vol. 25, pp. 129-143.
32. P. Kirschenhofer, H. Prodinger, and W. Szpankowski (1993), Multidimensional digital searching and some new parameters in tries, International Journal of Foundations of Computer Science, vol. 4, pp. 69-84.
33. D. E. Knuth (1973), The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA.
34. M. Ledoux (1966a), On Talagrand's deviation inequalities for product measures, ESAIM: Probability and Statistics, vol. 1, pp. 63-87.
35. M. Ledoux (1966b), Isoperimetry and gaussian analysis, in: Lectures on Probability Theory and Statistics (edited by P. Bernard), pp. 165-294, Ecole d'Eté de Probabilité de St-Flour XXIV-1994, Springer-Verlag, Berlin.
36. C. McDiarmid (1989), On the method of bounded differences, in: Surveys in Combinatorics (edited by I. Siemens), pp. 148-188, London Mathematical Society Lecture Note Series, vol. 141, Cambridge University Press, Cambridge.
37. C. McDiarmid (1985), Concentration, in: Probabilistic Methods for Algorithmic Discrete Mathematics (edited by M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed), pp. 195-248, Springer-Verlag, New York.
38. H. Mendelson (1982), Analysis of extendable hashing, IEEE Transactions on Software Engineering, vol. 8, pp. 611-619.
39. D. R. Morrison (1968), PATRICIA -Practical Algorithm To Retrieve Information Coded In Alphanumeric, Journal of the ACM, vol. 15, pp. 514-534.
40. J. A. Orenstein (1982), Multidimensional tries used for associative searching, Technical Report, School of Computer Science, McGill University, Montreal.
41. B. Pittel (1985), Asymptotical growth of a class of random trees, Annals of Probability, vol. 13, pp. 414-427.
42. B. Pittel (1986), Path in a random digital tree: limiting distributions, Advances in Applied Probability, vol. 18, pp. 139-155.
43. B. Pittel (1991), On the height of PATRICIA search tree, ORSA/TIMS Special Interest Conference on Applied Probability in the Engineering, Information and Natural Sciences, Monterey, CA.
44. B. Pittel and H. Rubin (1990), How many random questions are necessary to identify n distinct objects?, Journal of Combinatorial Theory, vol. A55, pp. 292-312.
45. C. Puech and H. Yahia (1985), Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing, in: Proceedings of the Symposium on Computational Geometry, pp. 272-280, ACM, New York.
46. B. Rais, P. Jacquet, and W. Szpankowski (1993), A limiting distribution for the depth in Patricia tries, SIAM Journal on Discrete Mathematics, vol. 6, pp. 197-213.
47. M. Régnier (1981), On the average height of trees in digital searching and dynamic hashing, Information Processing Letters, vol. 13, pp. 64-66.
48. M. Régnier (1981), Trie hashing analysis, in: Proceedings of the Fourth International Conference on Data Engineering, pp. 377-381, IEEE, Los Angeles, CA.
49. M. Régnier and P. Jacquet (1989), New results on the size of tries, IEEE Transactions on Information Theory, vol. IT-35, pp. 203-205.
50. W. Schachinger (1995), The variance of a partial match retrieval in a multidimensional symmetric trie, Random Structures and Algorithms, vol. 7, pp. 81-95.
51. W. Schachinger (2000), Limiting distributions for the costs of partial match retrievals in multidimensional tries, Random Structures and Algorithms, vol. 17, pp. 428-459.
52. W. Szpankowski (1988), Some results on V-ary asymmetric tries, Journal of Algorithms, vol. 9, pp. 224-244.
53. W. Szpankowski (1989), Digital data structures and order statistics, in: Algorithms and Data Structures: Workshop WADS '89 Ottawa, pp. 206-217, Lecture Notes in Computer Science, vol. 382, Springer-Verlag, Berlin.
54. W. Szpankowski (1990), Patricia trees again revisited, Journal of the ACM, vol. 37, pp. 691-711.
55. W. Szpankowski (1991), On the height of digital trees and related problems, Algorithmica, vol. 6, pp. 256-277.
56. W. Szpankowski and C. Knessl (2000), Heights in generalized tries and PATRICIA tries, in: LATIN '2000, pp. 298-307, Lecture Notes in Computer Science, vol. 1776, Springer-Verlag, Berlin.
57. M. Talagrand (1998), An isoperimetric theorem on the cube and the Kimchine-Kahane inequalities, Proceedings of the American Mathematical Society, vol. 104, pp. 905-909.
58. M. Talagrand (1989), Isoperimetry and integrability of the sum of independent Banach-space valued random variables, Annals of Probability, vol. 17, pp. 1546-1570.
59. M. Talagrand (1990), Sample unboundedness of stochastic processes under increment conditions, Annals of Probability, vol. 18, pp. 1-49.
60. M. Talagrand (1991a), A new isoperimetric inequality and the concentration of measure phenomenon, in: Geometric Aspects of Functional Analysis (edited by J. Lindenstrauss and V. D. Milman), pp. 4-137, Lecture Notes in Mathematics, vol. 146, Springer-Verlag, New York.
61. M. Talagrand (1991 b), A new isoperimetric inequality for product measure and the tails of sums of independent random variables, Geometric and Functional Analysis, vol. 1, pp. 211-223.
62. M. Talagrand (1993a), Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem, Geometric and Functional Analysis, vol. 3, pp. 295-314.
63. M. Talagrand (1993b), New gaussian estimates for enlarged balls, Geometric and Functional Analysis, vol. 3, pp. 502-526.
64. M. Talagrand (1994), Sharper bounds for gaussian and empirical processes, Annals of Probability, vol. 22, pp. 28-76.
65. M. Talagrand (1995), Concentration of measure and isoperimetric inequalities in product spaces, Institut des Hautes Etudes Scientifiques. Publications Mathématiques, vol. 81, pp. 73-205.
66. M. Talagrand (1996a), New concentration inequalities in product spaces, Inventiones Mathematicae, vol. 126, pp. 505-563.
67. M. Talagrand (1996b), A new look at independence, Annals of Probability, vol. 24, pp. 1-34.
68. A. W. van der Vaart and J. A. Wellner (1996), Weak Convergence and Empirical Processes, Springer-Verlag, New York.