Quote: Bonsai trees compress large trie structures to 1/3; encodes indices with 32 by 32 bit multiplication

Quotation Skeleton

This paper shows how trees can be stored … suitable for large trees that grow monotonically with … \ceiling(log_2 n) bits per node where n is … [p. 284] To reconstruct [sibling m, parent T[i,j]] … [by integer multiplication, division, and remainder]. … [p. 285] For typical values … , a long integer multiplication of 32 by … machine architectures. … [p. 291] In typical applications that store large trie … over a third of what would otherwise have …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: compressed data (16 items)
Topic: suffix trie (18 items)
Topic: spelling errors (18 items)
Topic: trees (21 items)