Abstract

This research presents inverted lists as a new data structure for the dynamic dictionary matching algorithm. The inverted lists structure, which derives from the inverted index, is implemented by the perfect hashing table. The dictionary is constructed in optimal time and the individual patterns can be updated in minimal time. The searching phase scans the given text in a single pass, even in a worst case scenario. In experimental results, the inverted lists used less time and space than the traditional structures; the searches were processed and showed an efficient linear time.

Keywords

Cite this article

@article{cai-754,
  author  = {Chouvalit Khancome and Veera Boonjing},
  title   = {A New Linear-Time Dynamic Dictionary Matching Algorithm},
  journal = {Computing and Informatics},
  volume  = {32},
  number  = {5},
  pages   = {897--923},
  year    = {2013},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2013/5/a-new-linear-time-dynamic-dictionary-matching-algorithm/}
}
Download .bib