Engineering scalable, cache and space efficient tries for strings

@article{Askitis2010EngineeringSC,
  title={Engineering scalable, cache and space efficient tries for strings},
  author={Nikolas Askitis and Ranjan Sinha},
  journal={The VLDB Journal},
  year={2010},
  volume={19},
  pages={633-660}
}
  • 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
    The adaptive radix tree: ARTful indexing for main-memory databases
    • 216
    • PDF
    Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
    • 7
    • Highly Influenced
    Top Tree Compression of Tries
    • 4
    • PDF
    Dynamic Packed Compact Tries Revisited
    • 5
    • Highly Influenced
    Dynamic Path-Decomposed Tries
    • 1
    • Highly Influenced
    • PDF
    Efficient keyword search in fuzzy XML
    • 6
    Space- and Time-Efficient String Dictionaries
    • 1
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 117 REFERENCES
    Mining frequent patterns without candidate generation
    • 5,107
    • PDF
    Fast algorithms for mining association rules
    • 7,926
    • PDF
    Trie memory
    • 1,027
    • PDF
    A Space-Economical Suffix Tree Construction Algorithm
    • 1,708
    • PDF
    Advanced Compiler Design and Implementation
    • 2,487
    • PDF
    Compiler transformations for high-performance computing
    • 892
    • PDF
    Effective Hardware Based Data Prefetching for High-Performance Processors
    • 534
    • PDF
    Cache Conscious Indexing for Decision-Support in Main Memory
    • 294
    • PDF
    Making B+- trees cache conscious in main memory
    • 353
    • PDF