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

DOI10.1016/J.INS.2013.04.037zbMATH Open1355.68072OpenAlexW2047396520MaRDI QIDQ508702FDOQ508702

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)