Burst tries: a fast, efficient data structure for string keys

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on (Office) Information Systems

Burst tries: a fast, efficient data structure for string keys

Steffen Heinz, Justin Zobel, Hugh E. Williams

Journal Title: ACM Transactions on (Office) Information Systems

Date: 2002

Volume: 20

Issue: 2

p. 192 - 223

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cs.rmit.edu.au/~jz/fulltext/acmtois02.pdf

For further information about this item go to:

http://doi.acm.org/10.1145/506309.506312

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12