Data structure for dynamic patterns

Simple item page
dc.contributor.authorKhancome, Chouvalit
dc.contributor.authorBoonjing, Veera
dc.date.accessioned2026-08-06T09:59:32Z
dc.date.available2026-08-06T09:59:32Z
dc.date.issued2010-01-01
dc.description.abstractString 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.
dc.identifier.citationProceedings of the International Multiconference of Engineers and Computer Scientists 2010 Imecs 2010, 399-404, 2010
dc.identifier.other2-s2.0-79952415238
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/2862
dc.sourceProceedings of the International Multiconference of Engineers and Computer Scientists 2010 Imecs 2010
dc.subjectBit-parallel
dc.subjectData Structure
dc.subjectDictionary matching
dc.subjectHashing Table
dc.subjectInverted index
dc.subjectInverted list
dc.subjectMultiple String Matching
dc.subjectString Matching
dc.subjectSuffix Tree
dc.subjectTrie
dc.titleData structure for dynamic patterns
dc.typeConference Paper

Files

Collections

Research