Multi-dimensional associative search engine

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S108000

Reexamination Certificate

active

06957215

ABSTRACT:
A device for, and method of, storing data in a memory, and for extracting the data therefrom based on a multi-dimensional input (MDI) key, the device including a first and at least a second associative search engine (ASE), each including: (i) a memory having: (A) a first array of cells containing a field of entries, each of the cells being accessible via an input key including a string corresponding to at least a portion of the MDI key, and (B) a second array of cells having a plurality of associated data entries, each of the associated data entries being associated with a particular one of the entries in the first array, and (ii) control logic for operatively connecting the first and the second ASE, the control logic for processing at least a portion of the entries in the first array from each ASE, in response to the input key, so as to determine a match between the input key and an entry of said entries in said field; the control logic for producing a result pertaining to an associated data entry based on the determination, and wherein the control logic utilizes the result from the first ASE in the processing of the second ASE, so as to narrow searching within the second ASE.

REFERENCES:
patent: 5920886 (1999-07-01), Feldmeier
patent: 6237061 (2001-05-01), Srinivasan et al.
patent: 6374326 (2002-04-01), Kansal et al.
patent: 6606681 (2003-08-01), Uzun
patent: 6633953 (2003-10-01), Stark
patent: 6711661 (2004-03-01), Zabarski et al.
patent: 6732228 (2004-05-01), Willardson
patent: 6757780 (2004-06-01), Stark
patent: 6789116 (2004-09-01), Sarkissian et al.
patent: 6839800 (2005-01-01), Stark
patent: 2002/0049922 (2002-04-01), Direen
patent: 2004/0128434 (2004-07-01), Khanna et al.
Bruza et al, Interactive Internet search: Keyword, directory and query reformulation mechanisms compared, PROC 23rdACM SIGIR conference on Research and development in information retrieval, Jul. 2000.
U.S. Appl. No. 09/779,941, filed Feb. 2001, Stark.
U.S. Appl. No. 10/040,389, filed Jan. 2002, Stark.
U.S. Appl. No. 10/206,189, filed Jul. 2002, Kastoriano et al.
U.S. Appl. No. 10/229,065, filed Aug. 2002, Stark.
Goodman et al: “Discrete and Computational Geometry” CRC Press 1997.
De Berg: “Computational Geometry, Algorithms and Applications” Springer-Verlag 2000.
Gupta et al; “Algorithms for Packet Classification”: IEEE Network Mar./Apr. 2001 pp. 24-32.
Lakshman et al; “High-Speed Policy-based Packet Forwarding Using Efficient Multidimensional Range Matching” ACO Comp Communication Review 28(4) pp. 203-214 ACM SIGCOMM'98 (Sep. 1998).
Decasper et al; “Router plugins: a software architecture for next-generation routers” IEEE/ACM trans, Networking 8(1):2-15, Feb. 2000.
Semeria; “Implementing a Flexible Hardware-based Router for the New IP Infrastructure”.
Peng et al; “Content-Addressable Memory (CAM) and its network applications” International IC-Korea Conference proceedings, Altera International Ltd.

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

Multi-dimensional associative search engine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-dimensional associative search engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-dimensional associative search engine will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3458310

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