Efficient processing of substring match queries with inverted variable-length gram indexes

DOI10.1016/j.ins.2013.04.037zbMath1355.68072OpenAlexW2047396520MaRDI QIDQ508702

Kyuseok Shim, Hyoungmin Park, Kyoung-Gu Woo, Young-Hoon Kim

Publication date: 8 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.04.037

zbMATH Keywords

database managementquery processing\( q\)-gram indexsubstring matchingvariable-length gram

Mathematics Subject Classification ID

Database theory (68P15) Algorithms on strings (68W32)

Related Items (1)

Efficient processing of substring match queries with inverted variable-length gram indexes

Uses Software

• WordNet

Cites Work

• Unnamed Item
• String matching with alphabet sampling
• Efficient processing of substring match queries with inverted variable-length gram indexes
• Size-estimation framework with applications to transitive closure and reachability
• An improvement of the Aho-Corasick machine
• Regular biosequence pattern matching with cellular automata
• The string B-tree
• Flexible and adaptable buffer management techniques for database management systems

This page was built for publication: Efficient processing of substring match queries with inverted variable-length gram indexes