The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
1989
DOI: 10.1007/3-540-51324-8_38
|View full text |Cite
|
Sign up to set email alerts
|

Design and analysis of a parallel VLSI string search algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1990
1990
1992
1992

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…We have designed a second high-performance VLSI search processor specifically to deal with utistructured data [ 15] and have analyzed the architectural support issues associated with on-the-fly text search in large documents [18]. We have also investigated a hybrid approach that uses both the data filter and text filter together to resolve data requests on a combination of both structutecl ancl unstructured data.…”
Section: Discussionmentioning
confidence: 99%
“…We have designed a second high-performance VLSI search processor specifically to deal with utistructured data [ 15] and have analyzed the architectural support issues associated with on-the-fly text search in large documents [18]. We have also investigated a hybrid approach that uses both the data filter and text filter together to resolve data requests on a combination of both structutecl ancl unstructured data.…”
Section: Discussionmentioning
confidence: 99%
“…A fanout of 1000 can therefore be achieved in two cascaded buffer stages with a total delay of only 1.4 (ns). The estimated time required for a broadcast, comparison, and detection cycle is about 33 (ns) [8]. Therefore, the effective search rate for a 100-comparator VLSI text search chip can reach 3 (GB/s) (100/33 (ns)).…”
Section: B Unformatted Text Searchmentioning
confidence: 99%