Name
Abstract | ||
|---|---|---|
For comprehensive analyzing or efficient searching from massive data, string matching is widely used as a core technique of the network traffic detection applications and text editors. However, the increasing compressed text challenges string matching to achieve high-speed processing. In this paper, we propose KCM, a fast Knuth-Morris-Pratt based string matching method over LZ77 compressed text. I... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/DCC50243.2021.00070 | 2021 Data Compression Conference (DCC) |
Keywords | DocType | ISSN |
Upper bound,Data compression,Telecommunication traffic,Throughput | Conference | 1068-0314 |
ISBN | Citations | PageRank |
978-1-6654-0333-7 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiuwen Sun | 1 | 1 | 2.08 |
| Di Wu | 2 | 0 | 0.34 |
| Da Mo | 3 | 0 | 0.34 |
| Jie Cui | 4 | 60 | 11.46 |
| Hong Zhong | 5 | 208 | 33.15 |