Location of Repository

E D I C T The internal extent formula for compacted tries

By Paolo Boldi and Sebastiano Vigna


It is well known [Knu97, pages 399–400] that in a binary tree the external path length minus the internal path length is exactly 2n 2, where n is the number of external nodes. We show that a generalization of the formula holds for compacted tries, replacing the role of paths with the notion of extent, and the value 2n 2 with the trie measure, an estimation of the number of bits that are necessary to describe the trie

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://vigna.dsi.unimi.it/ftp/... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.