Multidimensional Digital Searching and Some New Parameters in Tries

Multidimensional digital searching (M-d tries) is analyzed from the view point of partial match retrieval. Our first result extends the analysis of Flajolet and Puech of the average cost of retrieval under the Bernoulli model to biased probabilities of symbols occurrences in a key. The second main finding concerns the variance of the cost of the retrieval in the unbiased case. This variance is of order O(N1−s/M) where N is the number of records stored in an M-d trie, and s is the number of specified components in a query of size M. For M=2 and s=1 we present a detailed analysis of the variance, which identifies the constant at . This analysis, which is the central part of our paper, requires certain series transformation identities which go back to Ramanujan. In the Appendix we provide a Mellin transform approach to these results.

[1]  Philippe Jacquet,et al.  Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach , 1994, J. Comb. Theory A.

[2]  H. Prodinger,et al.  ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS , 1991 .

[3]  Philippe Flajolet,et al.  Partial match retrieval of multidimensional data , 1986, JACM.

[4]  Helmut Prodinger,et al.  Multidimensional Digital Searching-Alternative Data Structures , 1994, Random Struct. Algorithms.

[5]  Jonathan M. Borwein,et al.  Pi and the AGM , 1999 .

[6]  Philippe Flajolet,et al.  Digital Search Trees Revisited , 1986, SIAM J. Comput..

[7]  Wojciech Szpankowski,et al.  Self-Alignments in Words and Their Applications , 1992, J. Algorithms.

[8]  Wojciech Szpankowski,et al.  The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures , 1988, Inf. Process. Lett..

[9]  T. Apostol.  Modular Functions and Dirichlet Series in Number Theory , 1976 .

[10]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[11]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[14]  Andrew Odlyzko,et al.  Long repetitive patterns in random sequences , 1980 .

[15]  Helmut Prodinger,et al.  On the variance of the external path length in a symmetric digital trie , 1989, Discret. Appl. Math..

[16]  Wojciech Szpankowski,et al.  A Note on the Height of Suffix Trees , 1992, SIAM J. Comput..

[17]  Brian Davies,et al.  Integral transforms and their applications , 1978 .

[18]  Mireille Régnier,et al.  New results on the size of tries , 1989, IEEE Trans. Inf. Theory.

[19]  Helmut Prodinger,et al.  On the Balance Property of Patricia Tries: External Path Length Viewpoint , 1989, Theor. Comput. Sci..

[20]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[21]  Micha Hofri,et al.  On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel , 1986 .

[22]  B. Berndt.  Ramanujan's Notebooks , 1985 .

[23]  Richard Bellman,et al.  Analytic Number Theory: An Introduction , 1980 .

[24]  Michael S. Waterman,et al.  An extreme value theory for long head runs , 1986 .