Chapter 4 Reference 96

Burst Tries: A Fast, Efficient Data Structure for String Keys

Steffen Heinz, Justin Zobel and Hugh E. Williams

ACM Transactions on Information Systems 2002 web.archive.org

Open the original at web.archive.org

As cited in DDIA

Steffen Heinz, Justin Zobel, and Hugh E. Williams. "Burst Tries: A Fast, Efficient Data Structure for String Keys." ACM Transactions on Information Systems, volume 20, issue 2, pages 192–223, April 2002. doi:10.1145/506309.506312

Link check

Status: Link checked and reachable (HTTP 200)
Format: application/pdf
Size: 0.3 MB
Last checked: 2026-08-29

Identifiers and archived copies

DOI: 10.1145/506309.506312