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

DOI10.1016/J.INS.2013.04.037MaRDI QIDQ508702zbMATH OpenOpenAlexFDO

Authors Hyoungmin Park, Kyuseok Shim, 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

query processingdatabase management\( q\)-gram indexsubstring matchingvariable-length gram

Mathematics Subject Classification ID

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

Recommendations

• Approximate string processing
• Two-dimensional substring indexing.
• Using signature hashing for approximate string matching
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An improvement of the Aho-Corasick machine
• Efficient processing of substring match queries with inverted variable-length gram indexes
• Flexible and adaptable buffer management techniques for database management systems
• Regular biosequence pattern matching with cellular automata
• Size-estimation framework with applications to transitive closure and reachability
• String matching with alphabet sampling
• The string B-tree

Cited in

(2)

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

Describes a project that uses

Uses Software

• WordNet

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

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