Name
Abstract | ||
|---|---|---|
This paper shows how trees can be stored in a very compact form, called `Bonsai", using hashtables. A method is described that is suitable for large trees that grow monotonically within apredefined maximum size limit. Using it, pointers in any tree can be represented within 6 +log 2 nbits per node where n is the maximum number of children a node can have. We first describe ageneral way of storing trees in hash tables, and then introduce the idea of compact hashing whichunderlies the Bonsai ... |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1002/spe.4380230305 | Softw., Pract. Exper. |
Keywords | DocType | Volume |
compact representation | Journal | 23 |
Issue | ISSN | Citations |
3 | 0038-0644 | 23 |
PageRank | References | Authors |
3.22 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John J. Darragh | 1 | 41 | 5.43 |
| John G. Cleary | 2 | 1791 | 365.78 |
| Ian H. Witten | 3 | 15346 | 1507.14 |