On the weak prefix-search problem

DOI10.1016/j.tcs.2012.06.011zbMath1292.68181OpenAlexW2119246514MaRDI QIDQ390882

Paolo Ferragina

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.011

zbMATH Keywords

compressed indexes for string dictionariesenergy-efficient data structuresprefix searchweighted data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• The string B-tree
• Cache-Oblivious Algorithms
• Cache-oblivious string dictionaries
• Fast Prefix Search in Little Space, with Applications
• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage