Compact Balanced Tries
Overview & Synopsis
We show how it is possible to split Compact Tries described as bit-lists in a segmented and flexible structure of B-tree type, keeping the compactness advantages of the Compact Tries and recovering all the important properties of B-trees.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Compact Balanced Tries |
|---|---|
| Author / Organization | Pierre Nicodème |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 1992 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-232390 |
| Original Source Link | Visit Source Page on hal.science » |