Affiliation:
1. RMIT University, Melbourne, Australia
2. NICTA, University of Melbourne, Australia
Abstract
A key decision when developing in-memory computing applications is choice of a mechanism to store and retrieve strings. The most efficient current data structures for this task are the hash table with move-to-front chains and the burst trie, both of which use linked lists as a substructure, and variants of binary search tree. These data structures are computationally efficient, but typical implementations use large numbers of nodes and pointers to manage strings, which is not efficient in use of cache. In this article, we explore two alternatives to the standard representation: the simple expedient of including the string in its node, and, for linked lists, the more drastic step of replacing each list of nodes by a contiguous array of characters. Our experiments show that, for large sets of strings, the improvement is dramatic. For hashing, in the best case the total space overhead is reduced to less than 1 bit per string. For the burst trie, over 300MB of strings can be stored in a total of under 200MB of memory with significantly improved search time. These results, on a variety of data sets, show that cache-friendly variants of fundamental data structures can yield remarkable gains in performance.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference141 articles.
1. A super scalar sort algorithm for RISC processors
2. Software caching vs. prefetching
3. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms 1st Ed. Addison-Wesley Boston MA. Aho A. V. Hopcroft J. E. and Ullman J. D. 1974. The Design and Analysis of Computer Algorithms 1st Ed. Addison-Wesley Boston MA.
4. Allen R. and Kennedy K. 2001. Optimizing Compilers for Modern Architectures. Morgan Kaufmann San Francisco CA. Allen R. and Kennedy K. 2001. Optimizing Compilers for Modern Architectures. Morgan Kaufmann San Francisco CA.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献