Improved Behaviour of Tries by Adaptive Branching

@article{Andersson1993ImprovedBO,
  title={Improved Behaviour of Tries by Adaptive Branching},
  author={Arne Andersson and Stefan Nilsson},
  journal={Inf. Process. Lett.},
  year={1993},
  volume={46},
  pages={295-300}
}
We introduce and analyze a method to reduce the search cost in tries. Traditional trie structures use branching factors at the nodes that are either xed or a function of the number of elements. Instead, we let the distribution of the elements guide the choice of branching factors. This is accomplished in a strikingly simple way: in a binary trie, the i highest complete levels are replaced by a single node of degree 2 i ; the compression is repeated in the sub-tries. This structure, the level… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Entropy and maximal spacings for random partitions

  • E. Slud
  • Zeitschrift f ur Wahrscheinlichkeitstheorie…
  • 1978
Highly Influential
4 Excerpts

Handbook of Algorithms and Data Struc- tures

  • G. H. Gonnet, R. Baeza-Yates
  • Addison-Wesley,
  • 1991
2 Excerpts

ub. A guided tour of cherno bounds

  • T. Hagerup, R C.
  • Information Processing Letters,
  • 1990

Paths in a random digital tree: limiting distributions

  • B. Pittel
  • Advances in Applied Probability, 18:139{155,
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…