Self-adjusting binary search trees
Journal of the ACM (JACM)
Source models for natural language text
International Journal of Man-Machine Studies
Introduction to algorithms
An evaluation of self-adjusting binary search tree techniques
Software—Practice & Experience
Overview of the second text retrieval conference (TREC-2)
TREC-2 Proceedings of the second conference on Text retrieval conference
Data structures and algorithm analysis in C (2nd ed.)
Data structures and algorithm analysis in C (2nd ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Self-adjusting trees in practice for large text collections
Software—Practice & Experience
Handbook of Algorithms
In-memory hash tables for accumulating text vocabularies
Information Processing Letters
Performance in Practice of String Hashing Functions
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Efficient single-pass index construction for text databases
Journal of the American Society for Information Science and Technology
Cache-conscious sorting of large sets of strings with dynamic tries
Journal of Experimental Algorithmics (JEA)
Fast Single-Pass Construction of a Half-Inverted Index
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Fast construction of the HYB index
ACM Transactions on Information Systems (TOIS)
| Hi-index | 0.00 |
Fundamental structures such as trees and hash tables are used for managing data in a huge variety of circumstances. Making the right choice of structure is essential to efficiency. In previous work we have explored the performance of a range of data structures---different forms of trees, tries, and hash tables---for the task of managing sets of millions of strings, and have developed new variants of each that are more efficient for this task than previous alternatives. In this paper we test the performance of the same data structures on small sets of strings, in the context of document processing for index construction. Our results show that the new structures, in particular our burst trie, are the most efficient choice for this task, thus demonstrating that they are suitable for managing sets of hundreds to millions of distinct strings, and for input of hundreds to billions of occurrences.