(2)
|
Abstract:
Digital trees or tries are a general purpose exible data structure that implements dictionaries built on words. The present paper is focussed on the average-case analysis of an important parameter of this tree-structure, i.e., the stack-size. The stack-size of a tree is the memory needed by a storage-optimal preorder traversal. The analysis is carried out under a general model in which words are produced by a source (in the information-theoretic sense) that emits symbols. Under some natural assumptions that encompass all commonly used data models (and more), we obtain a precise average-case and probabilistic analysis of stack-size. Furthermore, we study the dependency between the stack-size and the ordering on symbols in the alphabet: we establish that, when the source emits independent symbols, the optimal ordering arises when the most probable symbol is the last one in this order. Keywords: Average-case Analysis of data-structures, Information Theory, Trie, Mellin analysis. 1
Citations
| 507 | The Art of Computer Programming, volume 3: Sorting and Searching – Knuth - 1997 |
| 169 | Trie memory – Fredkin - 1960 |
| 57 | Partial-match retrieval algorithms – RIVEST - 1976 |
| 50 | Partial Match Retrieval of Multidimensional Data – Flajolet, Puech - 1986 |
| 34 | Dynamical sources in information theory: a general analysis of trie structures – Clément, Flajolet, et al. - 2001 |
| 18 | Some results on V -ary asymmetric tries – Szpankowski - 1988 |
| 7 | Set representation and set intersection – Pardo, L - 1978 |
| 5 | On the height of digital trees and related problem. Algorithmica (6 – Szpankowski - 1991 |
| 4 | A note on the analysis of extendible hashing – Yao - 1980 |
| 3 | On the performance of evaluaion of extendible hashing and trie searching – Flajolet - 1983 |
| 3 | Trie hashing analysis – egnier, M - 1988 |
| 2 | The Stack-Size of Tries, submitted – Nebel - 1999 |
| 2 | On the average height of trees – egnier, M - 1982 |
| 1 | The Stack-Size of Tries Revisited – Nebel |
