WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm
The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-pattern string matching algorithm in practice except when the pattern number is very large or the alphabet size is small[2]. Theoretically, the scanning time of WM is average-optimal (i.e. O(nlogσ(rm)/m)), but in th...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 523 |
|---|---|
| container_issue | |
| container_start_page | 515 |
| container_title | |
| container_volume | |
| creator | Chen, Xunxun Fang, Binxing Li, Lei Jiang, Yu |
| description | The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-pattern string matching algorithm in practice except when the pattern number is very large or the alphabet size is small[2]. Theoretically, the scanning time of WM is average-optimal (i.e. O(nlogσ(rm)/m)), but in the worst case, its scanning time can not be evaluated at all. The maximum shift of the original WM algorithm is m-B+1, where m is the minimum length of all patterns and B is the q-gram size. The tuned WM algorithm (abbreviated as WM+) can reach higher performance by improving the shift table building algorithm and combining the AC algorithm with the original WM algorithm. And the scanning time of the WM+ algorithm in the worst case is predictable. Experiments show that the scanning time of the WM+ algorithm is less or not great than that of the WM algorithm for varied size of m and number of patterns, especially in the worst case. |
| doi_str_mv | 10.1007/11573937_55 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17413054</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17413054</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-adc7cdc382d8743db6b4d611d0b922f34c0730d7c44ba0a7843ff0c3f80705c23</originalsourceid><addsrcrecordid>eNpNkEtPwzAQhM1LopSe-AO-cEAosPbadcytrXhJjSoEqMfIsZM2kCZRbA78exIVCfayK81otN8QcsHghgGoW8akQo0qlfKATLSKUQpAzkCxQzJiU8YiRKGPyNkgcD1FLY_JCBB4pJXAUzLx_gP6wT5JyBF5WSfXd3RW01Ubyp2paPJVhTJqTQh5V9PX0JX1hiYm2O1wzKpN05Vhu6Nz43NHm5qGbU7XyZ9yTk4KU_l88rvH5P3h_m3xFC1Xj8-L2TJqOdMhMs4q6yzG3MX9Zy6bZsL1AA4yzXmBwoJCcMoKkRkwKhZYFGCxiEGBtBzH5HKf2xpvTVV0pralT9uux-i-U6YEQ5Ci913tfb4dWPIuzZrm06cM0qHT9F-n-AOxuGIE</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm</title><source>Springer Books</source><creator>Chen, Xunxun ; Fang, Binxing ; Li, Lei ; Jiang, Yu</creator><contributor>Nejdl, Wolfgang ; Xu, Ming ; Cao, Jiannong</contributor><creatorcontrib>Chen, Xunxun ; Fang, Binxing ; Li, Lei ; Jiang, Yu ; Nejdl, Wolfgang ; Xu, Ming ; Cao, Jiannong</creatorcontrib><description>The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-pattern string matching algorithm in practice except when the pattern number is very large or the alphabet size is small[2]. Theoretically, the scanning time of WM is average-optimal (i.e. O(nlogσ(rm)/m)), but in the worst case, its scanning time can not be evaluated at all. The maximum shift of the original WM algorithm is m-B+1, where m is the minimum length of all patterns and B is the q-gram size. The tuned WM algorithm (abbreviated as WM+) can reach higher performance by improving the shift table building algorithm and combining the AC algorithm with the original WM algorithm. And the scanning time of the WM+ algorithm in the worst case is predictable. Experiments show that the scanning time of the WM+ algorithm is less or not great than that of the WM algorithm for varied size of m and number of patterns, especially in the worst case.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540296395</identifier><identifier>ISBN: 9783540296393</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540321071</identifier><identifier>EISBN: 3540321071</identifier><identifier>DOI: 10.1007/11573937_55</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Alphabet Size ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Pattern Length ; Scanning Time ; Software ; String Match ; Time Complexity</subject><ispartof>Advanced Parallel Processing Technologies, 2005, p.515-523</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11573937_55$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11573937_55$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17413054$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Nejdl, Wolfgang</contributor><contributor>Xu, Ming</contributor><contributor>Cao, Jiannong</contributor><creatorcontrib>Chen, Xunxun</creatorcontrib><creatorcontrib>Fang, Binxing</creatorcontrib><creatorcontrib>Li, Lei</creatorcontrib><creatorcontrib>Jiang, Yu</creatorcontrib><title>WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm</title><title>Advanced Parallel Processing Technologies</title><description>The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-pattern string matching algorithm in practice except when the pattern number is very large or the alphabet size is small[2]. Theoretically, the scanning time of WM is average-optimal (i.e. O(nlogσ(rm)/m)), but in the worst case, its scanning time can not be evaluated at all. The maximum shift of the original WM algorithm is m-B+1, where m is the minimum length of all patterns and B is the q-gram size. The tuned WM algorithm (abbreviated as WM+) can reach higher performance by improving the shift table building algorithm and combining the AC algorithm with the original WM algorithm. And the scanning time of the WM+ algorithm in the worst case is predictable. Experiments show that the scanning time of the WM+ algorithm is less or not great than that of the WM algorithm for varied size of m and number of patterns, especially in the worst case.</description><subject>Alphabet Size</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Pattern Length</subject><subject>Scanning Time</subject><subject>Software</subject><subject>String Match</subject><subject>Time Complexity</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540296395</isbn><isbn>9783540296393</isbn><isbn>9783540321071</isbn><isbn>3540321071</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkEtPwzAQhM1LopSe-AO-cEAosPbadcytrXhJjSoEqMfIsZM2kCZRbA78exIVCfayK81otN8QcsHghgGoW8akQo0qlfKATLSKUQpAzkCxQzJiU8YiRKGPyNkgcD1FLY_JCBB4pJXAUzLx_gP6wT5JyBF5WSfXd3RW01Ubyp2paPJVhTJqTQh5V9PX0JX1hiYm2O1wzKpN05Vhu6Nz43NHm5qGbU7XyZ9yTk4KU_l88rvH5P3h_m3xFC1Xj8-L2TJqOdMhMs4q6yzG3MX9Zy6bZsL1AA4yzXmBwoJCcMoKkRkwKhZYFGCxiEGBtBzH5HKf2xpvTVV0pralT9uux-i-U6YEQ5Ci913tfb4dWPIuzZrm06cM0qHT9F-n-AOxuGIE</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Chen, Xunxun</creator><creator>Fang, Binxing</creator><creator>Li, Lei</creator><creator>Jiang, Yu</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm</title><author>Chen, Xunxun ; Fang, Binxing ; Li, Lei ; Jiang, Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-adc7cdc382d8743db6b4d611d0b922f34c0730d7c44ba0a7843ff0c3f80705c23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Alphabet Size</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Pattern Length</topic><topic>Scanning Time</topic><topic>Software</topic><topic>String Match</topic><topic>Time Complexity</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Xunxun</creatorcontrib><creatorcontrib>Fang, Binxing</creatorcontrib><creatorcontrib>Li, Lei</creatorcontrib><creatorcontrib>Jiang, Yu</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Xunxun</au><au>Fang, Binxing</au><au>Li, Lei</au><au>Jiang, Yu</au><au>Nejdl, Wolfgang</au><au>Xu, Ming</au><au>Cao, Jiannong</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm</atitle><btitle>Advanced Parallel Processing Technologies</btitle><date>2005</date><risdate>2005</risdate><spage>515</spage><epage>523</epage><pages>515-523</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540296395</isbn><isbn>9783540296393</isbn><eisbn>9783540321071</eisbn><eisbn>3540321071</eisbn><abstract>The WM algorithm, designed by Sun Wu and Udi Manber, is considered the fastest multi-pattern string matching algorithm in practice except when the pattern number is very large or the alphabet size is small[2]. Theoretically, the scanning time of WM is average-optimal (i.e. O(nlogσ(rm)/m)), but in the worst case, its scanning time can not be evaluated at all. The maximum shift of the original WM algorithm is m-B+1, where m is the minimum length of all patterns and B is the q-gram size. The tuned WM algorithm (abbreviated as WM+) can reach higher performance by improving the shift table building algorithm and combining the AC algorithm with the original WM algorithm. And the scanning time of the WM+ algorithm in the worst case is predictable. Experiments show that the scanning time of the WM+ algorithm is less or not great than that of the WM algorithm for varied size of m and number of patterns, especially in the worst case.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11573937_55</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advanced Parallel Processing Technologies, 2005, p.515-523 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17413054 |
| source | Springer Books |
| subjects | Alphabet Size Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Pattern Length Scanning Time Software String Match Time Complexity |
| title | WM+: An Optimal Multi-pattern String Matching Algorithm Based on the WM Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T22%3A37%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=WM+:%20An%20Optimal%20Multi-pattern%20String%20Matching%20Algorithm%20Based%20on%20the%20WM%20Algorithm&rft.btitle=Advanced%20Parallel%20Processing%20Technologies&rft.au=Chen,%20Xunxun&rft.date=2005&rft.spage=515&rft.epage=523&rft.pages=515-523&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540296395&rft.isbn_list=9783540296393&rft_id=info:doi/10.1007/11573937_55&rft_dat=%3Cpascalfrancis_sprin%3E17413054%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540321071&rft.eisbn_list=3540321071&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |