Cache-oblivious string dictionaries

DOI10.1145/1109557.1109621MaRDI QIDQ3581547zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Rolf Fagerberg

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109621

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cited in

(11)

• On the weak prefix-search problem
• On the weak prefix-search problem
• Sliding suffix tree
• Cache-oblivious index for approximate string matching
• Assembling approximately optimal binary search trees efficiently using arithmetics
• Non-overlapping indexing -- cache obliviously
• Succinct and I/O efficient data structures for traversal in trees
• I/O-efficient data structures for non-overlapping indexing
• I/O efficient dynamic data structures for longest prefix queries
• Fast compressed tries through path decompositions
• On Cartesian trees and range minimum queries

This page was built for publication: Cache-oblivious string dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581547)