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

@misc{HeinzBTAFE02_101, abstract = {Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each distinct word in the text, containing the word itself and information such as counters. We propose a new data structure, the burst trie, that has significant advantages over existing options for such applications: it requires no more memory than a binary tree; it is as fast as a trie; and, while not as fast as a hash...}, author = {Heinz, Steffen and Zobel, Justin and Williams, Hugh E. }, citeulike-article-id = {1250765}, posted-at = {2007-04-25 17:58:47}, priority = {2}, title = {Burst Tries: A Fast, Efficient Data Structure for String Keys}, url = {http://citeseer.ist.psu.edu/526368.html}, year = {2002} }

TY - GEN ID - HeinzBTAFE02_101 L3 - citeulike-article-id:1250765 TI - Burst Tries: A Fast, Efficient Data Structure for String Keys N2 - Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each distinct word in the text, containing the word itself and information such as counters. We propose a new data structure, the burst trie, that has significant advantages over existing options for such applications: it requires no more memory than a binary tree; it is as fast as a trie; and, while not as fast as a hash... AU - Heinz, Steffen AU - Zobel, Justin AU - Williams, Hugh PY - 2002/// UR - http://citeseer.ist.psu.edu/526368.html ER -