標題: Solution of Skip Distance Constraint on Sub-linear Time String-matching Architecture
作者: Huang, Nai-Lun
Lee, Tsern-Huei
Tseng, Kuo-Kun
交大名義發表
National Chiao Tung University
關鍵字: pre-filter;verification;sub-linear time;string matching;skip distance
公開日期: 2013
摘要: 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.
URI: http://hdl.handle.net/11536/135371
ISBN: 978-1-4799-2825-5
978-1-4799-2827-9
ISSN: 2159-3442
期刊: 2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON)
Appears in Collections:Conferences Paper