Burst Tries: A Fast, Efficient Data Structure for String Keys (2002)
by
Steffen Heinz
,
Justin Zobel
,
Hugh E. Williams
| Venue: | ACM Transactions on Information Systems |
| Citations: | 21 - 10 self |
Document Versions
| Burst Tries: A Fast, Efficient Data Structure for String Keys –Steffen Heinz, Justin Zobel, Hugh E. Williams — 2002 — ACM Transactions on Information Systems |
