Engineering scalable, cache and space efficient tries for strings

  title={Engineering scalable, cache and space efficient tries for strings},
  author={Nikolas Askitis and Ranjan Sinha},
  journal={The VLDB Journal},
  • Nikolas Askitis, Ranjan Sinha
  • Published 2010
  • Computer Science
  • The VLDB Journal
  • Storing and retrieving strings in main memory is a fundamental problem in computer science. The efficiency of string data structures used for this task is of paramount importance for applications such as in-memory databases, text-based search engines and dictionaries. The burst trie is a leading choice for such tasks, as it can provide fast sorted access to strings. The burst trie, however, uses linked lists as substructures which can result in poor use of CPU cache and main memory. Previous… CONTINUE READING
    21 Citations
    The adaptive radix tree: ARTful indexing for main-memory databases
    • 223
    • PDF
    Dynamic Path-Decomposed Tries
    • 2
    • Highly Influenced
    • PDF
    Space- and Time-Efficient String Dictionaries
    • 1
    • Highly Influenced
    Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
    • 7
    • Highly Influenced
    Put an elephant into a fridge
    BOPL: Batch Optimized Persistent List
    Top Tree Compression of Tries
    • 5
    • PDF
    c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches
    • 1
    • PDF


    Burst tries: a fast, efficient data structure for string keys
    • 165
    • Highly Influential
    • PDF
    Cache-efficient string sorting using copying
    • 49
    • PDF
    Cache-oblivious string B-trees
    • 79
    • PDF
    HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings
    • 63
    • PDF
    Cache-Conscious Collision Resolution in String Hash Tables
    • 29
    • PDF
    B-tries for disk-based string management
    • 21
    • PDF
    Cache Conscious Indexing for Decision-Support in Main Memory
    • 299
    • PDF
    Fast and Compact Hash Tables for Integer Keys
    • 32
    • PDF
    Adaptive Algorithms for Cache-Efficient Trie Search
    • 34
    • PDF