Solution of Skip Distance Constraint on Sub-linear Time String-matching Architecture

檔案

本條目沒有附加檔案。

日期

2013

期刊名稱

2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON)

摘要

Pre-filters are well-known techniques used to speed up string-matching process. The skip-based pre-filters make it possible to achieve sub-linear time complexity. However, they have a common constraint that their skip distances are bounded by the shortest keyword length. If the shortest keyword length is small, then this constraint will be a bottleneck problem in string-matching throughput. This paper provides a solution that the skip distance can be longer than the shortest keyword length. Also, a matching strategy based on the solution is proposed. This strategy can not only solve the bottleneck problem, but also reduce the operations in the sub-linear time string-matching procedure.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料