KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Item,
    Data structure for dynamic patterns
    (2010-01-01)
    Khancome, Chouvalit
    ;
    Boonjing, Veera
    String matching and dynamic dictionary matching are significant principles in computer science. These principles require an efficient data structure for accommodating the pattern or patterns to be searched for in a large given text. Moreover, in the dynamic dictionary matching, the structure is able to insert or delete the individual patterns over time. This research article introduces a new dynamic data structure named inverted lists for both principles. The inverted lists data structure, which is derived from the inverted index, is implemented by the perfect hashing idea. This structure focuses on the position of characters and provides a hashing table to store the string patterns. The new data structure is more time efficient than traditional structures. Also, this structure is faster to construct and consumes less memory than others.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Dynamic dictionary matching using inverted lists
    (2007-12-01)
    Khancome, Chouvalit
    ;
    Boonjing, Veera
    This paper proposes a new solution to the problem of dynamic dictionary matching. It employs inverted lists as data structures accommodating string patterns. The new solution takes (1) O(|P|) time for preprocessing, where |P| is a sum of the length of all patterns in set of pattern P; (2) O(|p|) time for insertion or deletion, where |p| is the length of pattern to be inserted or deleted; and (3) a search O(|t|+locc) time, where |t| is the length of input text and locc is the number of occurrences of matching between a character in the input text and in the inverted list.