System for plural-string search with a parallel collation of a f

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395800, 364DIG1, 364253, 3642254, 3642821, G06F 1730

Patent

active

054524512

ABSTRACT:
A parallel comparator for performing a parallel and high-speed processing for collation of partial character strings which are partially taken out of a plurality of character strings of interest to be searched out with a character string to be searched in which document data to be searched is arranged sequentially from a leading character, is provided in a front stage of an automaton executing device. Only when a part of the character string to be searched coincides with the partial character string set in the comparator, the collation of the remaining portion of the character string to be searched is performed by the automaton executing device. Also, it is possible to set "don't care" in which a character at any position in the partial character string is ignored at the time of comparison by the comparator and to set a negation condition in which the comparison by the comparator is made taking the negation of a character at any position in the partial character string.

REFERENCES:
patent: 3568156 (1971-03-01), Thompson
patent: 4384343 (1983-05-01), Morganti et al.
patent: 4450520 (1984-05-01), Hollaar et al.
patent: 4916635 (1990-04-01), Ohsone et al.
patent: 5003307 (1991-05-01), Whiting et al.
patent: 5051886 (1991-09-01), Kawaguchi et al.
patent: 5051947 (1991-09-01), Messenger et al.
patent: 5060143 (1991-10-01), Lee
patent: 5072367 (1991-12-01), Clayton et al.
patent: 5175860 (1992-12-01), Yamada
Sedgewick, Algorithms, Addison-Wesley 1983, Chapters 19-20, pp. 241-268.
Su, Database Computers, McGraw-Hill, 1988, Chapter 8, pp. 412-458.
Zeidler, H. "Content-Addressable Mass Memories," IEE Proceedings E. Computers & Digital Techniques, vol. 136, No. 5, Sep. 1989, pp. 351-356. (English).
Malms, M., et al. "Leistungssteigerung durch ein inhaltsadressierbares Speichersystem," Elektronische Rechenanlagen-MIT Computer Praxis, vol. 26, No. 4, Aug. 1984, pp. 179-185. (Abstract--English).
Yamada, Hachiro, et al. "Real-Time String Search Engine LSI for 800-Mbit/sec LANs," Proceedings of the IEEE 1988 Custom Integrated Circuits Conference, May 16-19, 1988, pp. 2161-2164. (English).
Ng, Yan H., et al. "Mapping with No Strings Attached," Proceedings of Conpar. Conference Papers: Plenary Sessions and Stream "A", Sep. 12-16, 1988, pp. 155-165. (English).
Thurber, Kenneth James. "An Associative Processor for Air Traffic Control", Proceedings of the Spring Joint Computer Conference, May 18-20, 1971, pp. 49-59. (English).
Fu, Beatrice, et al. "Performance and Microarchitecture of the 1486 Processor," Proceedings of the 1989 IEEE International Conference on Computer Design: VLSI in Computers & Processors, Oct. 2-4, 1989, pp. 182-187. (English).
Doi, Katsuyuki, et al. "CMOS 8-Bit 1-Chip Microcomputer TMP80C49," Toshiba Review, No. 138, Mar.-Apr. 1982, pp. 29-32. (English).
R. L. Haskin, et al., "Operational Characteristics of Hardware-Based Pattern Matcher", ACM Trans. on Database Systems, vol. 8, No. 1, Mar. 1983. (Provided in English).
Alfred V. Aho, et al., "Efficient String Matching: An Aid to Bibliographic Search", Communications of the ACM, vol. 18, No. 6, Jun. 1975. (Provided in English).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System for plural-string search with a parallel collation of a f does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for plural-string search with a parallel collation of a f, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for plural-string search with a parallel collation of a f will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1835816

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.