Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Nai-Lun | en_US |
dc.contributor.author | Lee, Tsern-Huei | en_US |
dc.contributor.author | Tseng, Kuo-Kun | en_US |
dc.date.accessioned | 2017-04-21T06:50:02Z | - |
dc.date.available | 2017-04-21T06:50:02Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.isbn | 978-1-4799-2825-5 | en_US |
dc.identifier.isbn | 978-1-4799-2827-9 | en_US |
dc.identifier.issn | 2159-3442 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/135371 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | pre-filter | en_US |
dc.subject | verification | en_US |
dc.subject | sub-linear time | en_US |
dc.subject | string matching | en_US |
dc.subject | skip distance | en_US |
dc.title | Solution of Skip Distance Constraint on Sub-linear Time String-matching Architecture | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON) | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.identifier.wosnumber | WOS:000334921600280 | en_US |
dc.citation.woscount | 0 | en_US |
Appears in Collections: | Conferences Paper |