Efficient processing of substring match queries with inverted variable-length gram indexes (Q508702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improvement of the Aho-Corasick machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: String matching with alphabet sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-estimation framework with applications to transitive closure and reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible and adaptable buffer management techniques for database management systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string B-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient processing of substring match queries with inverted variable-length gram indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular biosequence pattern matching with cellular automata / rank
 
Normal rank

Latest revision as of 09:12, 13 July 2024

scientific article
Language Label Description Also known as
English
Efficient processing of substring match queries with inverted variable-length gram indexes
scientific article

    Statements

    Efficient processing of substring match queries with inverted variable-length gram indexes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2017
    0 references
    database management
    0 references
    query processing
    0 references
    substring matching
    0 references
    \( q\)-gram index
    0 references
    variable-length gram
    0 references

    Identifiers