|Número de publicación||US20080114760 A1|
|Tipo de publicación||Solicitud|
|Número de solicitud||US 11/932,434|
|Fecha de publicación||15 May 2008|
|Fecha de presentación||31 Oct 2007|
|Fecha de prioridad||7 Abr 2000|
|También publicado como||CA2405464A1, CA2405464C, CA2755373A1, CA2755373C, DE60136224D1, EP1368750A2, EP1368750B1, US6711558, US7181437, US7552107, US7680790, US7949650, US7953743, US8131697, US8549024, US9020928, US20040111392, US20070118500, US20080109413, US20080126320, US20080133453, US20080133519, US20120215801, US20140025656, WO2001080082A2, WO2001080082A3, WO2001080082A8|
|Número de publicación||11932434, 932434, US 2008/0114760 A1, US 2008/114760 A1, US 20080114760 A1, US 20080114760A1, US 2008114760 A1, US 2008114760A1, US-A1-20080114760, US-A1-2008114760, US2008/0114760A1, US2008/114760A1, US20080114760 A1, US20080114760A1, US2008114760 A1, US2008114760A1|
|Inventores||Ronald S. Indeck, Ron Kaplan Cytron, Mark Allen Franklin|
|Cesionario original||Indeck Ronald S, Ron Kaplan Cytron, Mark Allen Franklin|
|Exportar cita||BiBTeX, EndNote, RefMan|
|Citada por (42), Clasificaciones (21), Eventos legales (2)|
|Enlaces externos: USPTO, Cesión de USPTO, Espacenet|
This application is a continuation of U.S. application Ser. No. 11/621,001, filed Jan. 8, 2007, and entitled “Associative Database Scanning and Information Retrieval”, which is a continuation application of U.S. application Ser. No. 10/722,691, filed on Nov. 24, 2003, and entitled “Associative Database Scanning and Information Retrieval”, now U.S. Pat. No. 7,181,437, which is a continuation of U.S. application Ser. No. 09/545,472, filed Apr. 7, 2000, entitled “Associative Database Scanning and Information Retrieval”, now U.S. Pat. No. 6,711,558, the entire disclosures of each of which are incorporated herein by reference.
Associative memory devices are known in the prior art. Generally, these associative memory devices comprise peripheral memories for computers, computer networks, and the like, which operate asynchronously to the computer, network, etc. and provide increased efficiency for specialized searches. Additionally, it is also known in the prior art that these memory devices can include certain limited decision-making logic as an aid to a main CPU in accessing the peripheral memory. An example of such an associative memory device particularly adapted for use with a rotating memory such as a high speed disk or drum can be found in U.S. Pat. No. 3,906,455, the disclosure of which is incorporated herein by reference. This particular device provides a scheme for use with a rotating memory and teaches that two passes over a memory sector is necessary to presort and then sort the memory prior to performing any logical operations thereon. Thus, this device is taught as not being suitable for use with any linear or serial memory such as magnetic tape or the like.
Other examples of prior art devices may also be found in U.S. Pat. Nos. 3,729,712; 4,464,718; 5,050,075; 5,140,692; and 5,721,898; the disclosures of which are incorporated herein by reference.
As an example, in U.S. Pat. No. 4,464,718, Dixon performs fixed comparisons on a fixed number of bytes. They don't have the ability to scan and correlate arbitrarily over the data. They search serially along the tracks in a given disk cylinder but there is no provision for parallel searching across disks. Dixon's comparisons are limited by a fixed rigid number of standard logical operation types. Additionally, the circuitry presented supports only these single logical operations. There is no support for approximate or fuzzy matching.
While these prior art associative memory devices represent an attempt to speed the input and output of information to and from a peripheral memory, which in many cases is a mass storage memory device, all rely on the classic accessing of data stored in digital form by reading and interpreting the digital either address or content of the memory location. In other words, most such devices access data by its address but there are some devices that take advantage of the power of content addressing as is well known in the art. Nevertheless, in all of the prior art known to the inventors, the digital value of the address or data contained in the addressed location must be read and interpreted in its digital form in order to identify the data and then select it for processing. Not only does it take processing time to read and interpret the digital data represented by the address or content, this necessarily requires that the accessing circuit process the memory according to the structure of the data stored. In other words, if the data is stored in octets, then the accessing circuitry must access the data in octets and process it in an incremental manner. This “start and stop” processing serves to increase the input/output time required to access data. As is also well known in the art, this input/output time typically represents the bottleneck and effective limitation of processing power in any computer or computer network.
In order to solve these and other problems in the prior art, the inventors herein have succeeded in designing and developing a method and apparatus for an associative memory in several embodiments which provide an elegantly simple solution to these prior art limitations as well as dramatically decreased access times for data stored in mass storage memories. As mentioned, the invention has several embodiments each of which has its own advantages.
Generally, the invention may be described as a technique for data retrieval through approximate matching of a data key with a continuous reading of data as stored on a mass storage medium. In its broadest, and perhaps most powerful, embodiment, this key may be an analog signal and it is matched with an analog signal generated by a typical read/write device as it slews across the mass storage medium. In other words, the steps taught to be required in the prior art of not only reading the analog representation of digital data stored on the mass storage medium but also the conversion of that signal to its digital format prior to being compared are eliminated. Furthermore, there is no requirement that the data be “framed” or compared utilizing the structure or format in which the data has been organized and stored. For an analog signal, all that need be specified is the elapsed time of that signal which is used for comparison with a corresponding and continuously changing selected time portion of the “read” signal. Using any one of many standard correlation techniques as known in the prior art, the data “key” may then be approximately matched to the sliding “window” of data signal to determine a match. Significantly, the same amount of data may be scanned much more quickly and data matching the search request may be determined much more quickly as well. For example, the inventors have found that CPU based approximate searches of 200 megabytes of DNA sequences can take up to 10 seconds on a typical present day “high end” system, assuming the offline processing to index the database has already been completed. In that same 10 seconds, the inventors have found that a 10-gigabyte disk could be magnetically searched for approximate matches using the present invention. This represents a 50:1 improvement in performance. Furthermore, in a typical hard disk drive there are four surfaces and corresponding read/write heads, which may be all searched in parallel should each head be equipped with the present invention. As these searches can proceed in parallel, the total increase in speed or improvement represents a 200:1 advantage. Furthermore, additional hard disk drives may be accessed in parallel and scaled to further increase the advantage provided by the present invention.
By choosing an appropriate correlation or matching technique, and by setting an appropriate threshold, the search may be conducted to exactly match the desired signal, or more importantly and perhaps more powerfully, the threshold may be lowered to provide for approximate matching searches. This is generally considered a more powerful search mode in that databases may be scanned to find “hits” which may be valid even though the data may be only approximately that which is being sought. This allows searching to find data that has been corrupted, incorrectly entered data, data which only generally corresponds to a category, as well as other kinds of data searches that are highly desired in many applications. For example, a library of DNA sequences may be desired to be searched and hits found which represent an approximate match to a desired sequence of residues. This ensures that sequences which are close to the desired sequence are found and not discarded but for the difference in a forgivable number of residue mismatches. Still another application involves Internet searches provided by Internet search engines. In such a search, approximate matching allows for misspelled words, differently spelled words, and other variations to be accommodated without defeating a search or requiring a combinatorial number of specialized searches. This technique permits a search engine to provide a greater number of hits for any given search and ensure that a greater number of relevant web pages are found and cataloged in the search.
Still another possible application for the present invention is for accessing databases which may be enormous in size or which may be stored as analog representations. For example, our society has seen the implementation of sound recording devices and their use in many forums including judicial proceedings. In recent history, tape recordings made in the President's oval office have risen in importance with respect to impeachment hearings. As can be appreciated, tape recordings made over the years of a presidency can accumulate into a huge database which might require a number of persons to actually listen to them in order to find instances where particular words are spoken that might be of interest. Utilizing the present invention, an analog representation of that spoken word can be used as a key and sought to be matched while the database is scanned in a continuous manner and at rapid speed. Thus, the present invention provides a powerful search tool for massive analog databases as well as massive digital databases.
While text-based searches are accommodated by the present invention as described above, storage media containing pictures, sound, and other representations have traditionally been more difficult to search than text. The present invention allows searching a large data space for the presence of such content or fragments thereof. For example, the key in this case could be a row or quadrant of pixels that represent the image being sought. Approximate matching of the key's signal can then allow identification of matches or near matches to the key.
While the principal advantages and features of the present invention have been briefly explained above, a more thorough understanding of the invention may be attained by referring to the drawings and description of the preferred embodiment which follow.
As shown in
In the prior art as shown in the upper portion of
The approximate matching unit 24 may itself comprise a set of digital logic or analog circuitry organized to perform scanning, correlation, general logic and approximate matching functions on the signals received from the storage medium in conjunction with digital or analog representations of query directed key information. The functions may be performed by dedicated logic and circuitry, programmable logic and circuitry or by use of programmable processors such as digital signal processors (DSPs). The inventors contemplate that many different variations of hardware or programmed software devices may be used to virtually equal advantage in implementing the present invention and therefore do not contemplate any particular implementation as a better mode than another, at present, except as otherwise expressed herein. Furthermore, the present invention should not be considered as being tied to any specific data structure or application, those having been used herein are instead to be viewed as illustrative only. Using the present disclosure as a template, it is contemplated that one of ordinary skill in the art could readily construct a device as would perform the functions and operation necessary to achieve the purposes of the invention.
As has been explained above, the present invention may be used to perform both exact matches and approximate matches. When performing an exact match in the analog domain, at Point A in
The microprocessor or programmable logic device 22 may itself comprise one or more microprocessors, programmable logic units, dedicated logic and associated circuitry. This unit interfaces with the system or input/output bus 34 and, in one configuration, also interfaces with any disk caches 30 which may be present. The unit receives and processes requests and queries from the CPU 32 or network interface 36 and presents these requests in the appropriate form to approximate matching unit 24. Additionally the unit may aid in passing the results of the requests to either or both the disk cache 30 and/or the CPU 32 (by way of the bus 34).
More particularly, as shown in
Also shown in
As shown in
As shown in
As shown in
The configurations as exemplified by those shown in
As shown in
The query will typically result in the execution of one or more operating system utilities. As an example of a higher level utility command, for the UNIX operating system, this could be modified versions of glimpse, find, grep, apropos. Other such functions causing the CPU to send commands 66 such as search, approximate search, etc., to the approximate matching and pre-fetch processor of the present invention (see
At this point, depending upon the particular methodology desired to be implemented in the particular embodiment of the invention, it would be necessary that an analog or digital key is determined. This key is data, exact or approximate, that corresponds to the data being searched for. For an analog key, this key may either be pre-stored such as in the mass storage medium, developed using dedicated circuitry, or required to be generated. Should the analog key be pre-stored, a send pre-stored key step 68 would be performed by the microprocessor or programmable logic device 22 (see
Decision logic 84 would next make an intelligent decision as to whether a portion of data approximately matches or does not approximately match the key. Should a match be found, then the data is processed as at step 86 and the data requested by the query is sent to a disk cache 30, directly onto system bus 34, or otherwise be buffered or made available to a CPU 32, network interface 36, or otherwise as shown in
The inventors herein have preliminarily tested the present invention and have generated preliminary data demonstrating its operability and effectiveness.
As shown in
At approximately the point labeled 325, a distinct peak is noted which approaches 1, indicating a very close match between the key and the pseudo-random binary sequence. Thus, the present invention has been demonstrated as capable of finding a key that is present in a pseudo-random digital sequence.
Various changes and modifications to the present invention would be apparent to those skilled in the art but yet which would not depart from the spirit of the invention. Several of these alternatives have been indicated above. For example, all of the operations exemplified by the analog processing shown in
|Patente citante||Fecha de presentación||Fecha de publicación||Solicitante||Título|
|US7660793||12 Nov 2007||9 Feb 2010||Exegy Incorporated||Method and system for high performance integration, processing and searching of structured and unstructured data using coprocessors|
|US7680790||31 Oct 2007||16 Mar 2010||Washington University||Method and apparatus for approximate matching of DNA sequences|
|US7702629||2 Dic 2005||20 Abr 2010||Exegy Incorporated||Method and device for high performance regular expression pattern matching|
|US7711844||15 Ago 2002||4 May 2010||Washington University Of St. Louis||TCP-splitter: reliable packet monitoring methods and apparatus for high speed networks|
|US7716330||19 Oct 2001||11 May 2010||Global Velocity, Inc.||System and method for controlling transmission of data packets over an information network|
|US7840482||8 Jun 2007||23 Nov 2010||Exegy Incorporated||Method and system for high speed options pricing|
|US7917299||22 Feb 2006||29 Mar 2011||Washington University||Method and apparatus for performing similarity searching on a data stream with respect to a query string|
|US7921046||19 Jun 2007||5 Abr 2011||Exegy Incorporated||High speed processing of financial information using FPGA devices|
|US7945528||10 Feb 2010||17 May 2011||Exegy Incorporated||Method and device for high performance regular expression pattern matching|
|US7949650||31 Oct 2007||24 May 2011||Washington University||Associative database scanning and information retrieval|
|US7953743||31 Oct 2007||31 May 2011||Washington University||Associative database scanning and information retrieval|
|US7954114||26 Ene 2006||31 May 2011||Exegy Incorporated||Firmware socket module for FPGA-based pipeline processing|
|US8069102||20 Nov 2006||29 Nov 2011||Washington University||Method and apparatus for processing financial information at hardware speeds using FPGA devices|
|US8095508||21 May 2004||10 Ene 2012||Washington University||Intelligent data storage and processing using FPGA devices|
|US8131697||31 Oct 2007||6 Mar 2012||Washington University||Method and apparatus for approximate matching where programmable logic is used to process data being written to a mass storage medium and process data being read from a mass storage medium|
|US8156101||17 Dic 2009||10 Abr 2012||Exegy Incorporated||Method and system for high performance integration, processing and searching of structured and unstructured data using coprocessors|
|US8326819||12 Nov 2007||4 Dic 2012||Exegy Incorporated||Method and system for high performance data metatagging and data indexing using coprocessors|
|US8374986||15 May 2008||12 Feb 2013||Exegy Incorporated||Method and system for accelerated stream processing|
|US8379841||22 Mar 2007||19 Feb 2013||Exegy Incorporated||Method and system for high throughput blockwise independent encryption/decryption|
|US8407122||31 Mar 2011||26 Mar 2013||Exegy Incorporated||High speed processing of financial information using FPGA devices|
|US8458081||31 Mar 2011||4 Jun 2013||Exegy Incorporated||High speed processing of financial information using FPGA devices|
|US8478680||31 Mar 2011||2 Jul 2013||Exegy Incorporated||High speed processing of financial information using FPGA devices|
|US8515682||11 Mar 2011||20 Ago 2013||Washington University||Method and apparatus for performing similarity searching|
|US8549024||2 Mar 2012||1 Oct 2013||Ip Reservoir, Llc||Method and apparatus for adjustable data matching|
|US8595104||31 Mar 2011||26 Nov 2013||Ip Reservoir, Llc||High speed processing of financial information using FPGA devices|
|US8600856||31 Mar 2011||3 Dic 2013||Ip Reservoir, Llc||High speed processing of financial information using FPGA devices|
|US8620881||21 Jun 2011||31 Dic 2013||Ip Reservoir, Llc||Intelligent data storage and processing using FPGA devices|
|US8626624||31 Mar 2011||7 Ene 2014||Ip Reservoir, Llc||High speed processing of financial information using FPGA devices|
|US8655764||31 Mar 2011||18 Feb 2014||Ip Reservoir, Llc||High speed processing of financial information using FPGA devices|
|US8737606||5 Feb 2013||27 May 2014||Ip Reservoir, Llc||Method and system for high throughput blockwise independent encryption/decryption|
|US8751452||6 Ene 2012||10 Jun 2014||Ip Reservoir, Llc||Intelligent data storage and processing using FPGA devices|
|US8762249||7 Jun 2011||24 Jun 2014||Ip Reservoir, Llc||Method and apparatus for high-speed processing of financial market depth data|
|US8768805||7 Jun 2011||1 Jul 2014||Ip Reservoir, Llc||Method and apparatus for high-speed processing of financial market depth data|
|US8768888||6 Ene 2012||1 Jul 2014||Ip Reservoir, Llc||Intelligent data storage and processing using FPGA devices|
|US8843408||26 Oct 2010||23 Sep 2014||Ip Reservoir, Llc||Method and system for high speed options pricing|
|US8879727||29 Ago 2008||4 Nov 2014||Ip Reservoir, Llc||Method and apparatus for hardware-accelerated encryption/decryption|
|US8880501||9 Abr 2012||4 Nov 2014||Ip Reservoir, Llc||Method and system for high performance integration, processing and searching of structured and unstructured data using coprocessors|
|US8965872 *||29 Jun 2011||24 Feb 2015||Microsoft Technology Licensing, Llc||Identifying query formulation suggestions for low-match queries|
|US8983063||16 May 2014||17 Mar 2015||Ip Reservoir, Llc||Method and system for high throughput blockwise independent encryption/decryption|
|US8983995||23 Jun 2011||17 Mar 2015||Microsoft Corporation||Interactive semantic query suggestion for content search|
|US9020928||27 Sep 2013||28 Abr 2015||Ip Reservoir, Llc||Method and apparatus for processing streaming data using programmable logic|
|US9047243||5 Abr 2012||2 Jun 2015||Ip Reservoir, Llc||Method and apparatus for low latency data distribution|
|Clasificación de EE.UU.||1/1, 707/E17.039, 707/999.006|
|Clasificación internacional||G06F3/06, G06F17/30|
|Clasificación cooperativa||Y10S707/99936, G06F17/30047, Y10S707/99933, G06F17/30985, G06F17/30026, Y10S707/99931, G06F17/30982, G06F17/30492, G06F17/30017, G06F17/30864, G06F17/30386|
|Clasificación europea||G06F17/30S, G06F17/30Z2P5, G06F17/30Z2P3, G06F17/30E2P, G06F17/30E2A|
|28 Ene 2008||AS||Assignment|
Owner name: WASHINGTON UNIVERSITY, MISSOURI
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:INDECK, RONALD S.;CYTRON, RON KAPLAN;FRANKLIN, MARK ALLEN;REEL/FRAME:020424/0718
Effective date: 20000407
|12 Abr 2013||AS||Assignment|
Owner name: WASHINGTON UNIVERSITY, MISSOURI
Free format text: SECURITY AGREEMENT;ASSIGNOR:IP RESERVOIR, LLC;REEL/FRAME:030208/0330
Effective date: 20130322
Owner name: IP RESERVOIR, LLC, MISSOURI
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WASHINGTON UNIVERSITY;REEL/FRAME:030206/0466
Effective date: 20130322