| Summary: | 博士 === 中華大學 === 科技管理學系(所) === 97 === This thesis proposes a CMAC-based mechanism for efficiently determining whether a string pattern exists in a large string dataset. This category of problem is drawing increasing attentions as high-speed Internet prevails. The proposed mechanism seeks to achieve the following goals: (1) processing a query string must be efficient as well as uniform in run time regardless of the size of the dataset, and (2) on-line memory requirement must be economic. The former is important as the amount of data is growing in a dramatic fashion, while the latter is useful for implementations on hand-held devices. Several experiments were conducted for two application problems on different platforms, i.e., PC and PDA, for evaluating the proposed mechanism, and the results show favorable performances for the indicated goals.
|
|---|
