Loading...
Data structure for dynamic patterns
Author(s)
Khancome, Chouvalit
Boonjing, Veera
Date Issued
January 1, 2010
Type
Conference Paper
Abstract
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.
Citation
Proceedings of the International Multiconference of Engineers and Computer Scientists 2010 Imecs 2010, 399-404, 2010