Burst tries: a fast, efficient data structure for string keys.
Steffen Heinz|Justin Zobel|Hugh E. Williams
| Anthology ID: | DBLP:journals/tois/HeinzZW02 |
|---|---|
| Year: | 2002 |
| Venue: | ACM Transactions on Information Systems (TOIS) |
| Pages: | 192-223 |
| URL: | https://doi.org/10.1145/506309.506312 |
| DOI: | https://doi.org/10.1145/506309.506312 |
| DBLP: | journals/tois/HeinzZW02 |
| BibTeX: |
@article{heinz-2002-burst,
author = {Steffen Heinz and
Justin Zobel and
Hugh E. Williams},
title = {{Burst tries: a fast, efficient data structure for string keys}},
journal = {ACM Transactions on Information Systems (TOIS)},
volume = {20},
number = {2},
pages = {192--223},
year = {2002},
url = {https://doi.org/10.1145/506309.506312},
doi = {https://doi.org/10.1145/506309.506312}
}