Name
Abstract | ||
|---|---|---|
In this paper, we present the algorithm and architecture of a processor for approximate string matching with high throughput rate. The processor is dedicated for multimedia and information retrieval applications working on huge amounts of mass data where short response times are necessary. The algorithm used for the approximate string matching is based on a dynamic programming procedure known as the string-to-string correction problem. It has been extended to fulfill the requirements of full text search in a database system, including string matching with wildcards and handling of idiomatic turns of some languages. The processor has been fabricated in a 0.6-um CMOS technology. It performs a maximum of 8.5 Billion character comparisons per second when operating at the specified clock frequency of 132 MHz. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/ASAP.2000.862401 | ASAP |
Keywords | Field | DocType |
high throughput rate,billion character comparison,huge amount,approximate string matching,full text search,database system,programmable processor,dynamic programming procedure,idiomatic turn,approximate string,cmos technology,application specific integrated circuits,cmos,dynamic programming,edit distance,high throughput,database systems,vlsi,acceleration,string matching,wildcards,application software,throughput,information retrieval | String searching algorithm,Throughput (business),Edit distance,Dynamic programming,Commentz-Walter algorithm,Wildcard character,Computer science,Parallel computing,Real-time computing,Approximate string matching,Clock rate | Conference |
ISSN | ISBN | Citations |
1063-6862 | 0-7695-0716-6 | 15 |
PageRank | References | Authors |
1.21 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hans-Martin Blüthgen | 1 | 17 | 2.42 |
| Tobias Noll | 2 | 32 | 3.68 |