Thumbnail
Access Restriction
Subscribed

Author Aoe, J. I.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Special computer methods
Abstract This paper describes a method of implementing a static transition table of a string pattern matching machine to locate all occurrences of a finite number of keywords in a text string. The scheme combines the fast access of an array representation with the compactness of a list structure. Each transition can be computed from the present data structure in O(1) time and the storage is as small as the list structure. The construction and pattern matching programs associated with the present data structure are provided and the efficiency is evaluated by a empirical results.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1978-08-01
Publisher Place New York
Journal ACM SIGIR Forum (SIGF)
Volume Number 23
Issue Number 3-4
Page Count 12
Starting Page 22
Ending Page 33


Open content in new tab

   Open content in new tab
Source: ACM Digital Library