Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2000-08-25
2002-09-03
Coby, Frantz (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06446066
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to the field of computerized information search and retrieval systems and, more particularly, to a method and apparatus for comparing database search results.
BACKGROUND OF THE INVENTION
Information is increasingly being represented as digital bits of data and stored within electronic databases. These databases often include extremely large numbers of records containing data fields reflecting an endless variety of objects. Some databases, for example, contain the full text of judicial opinions issued by every court in the United States for the past one hundred and fifty years. Other databases may be filled with data fields containing particularized information about vast numbers of individuals (e.g., names, addresses, telephone numbers, etc.). As more information is stored in these databases, the larger these data compilations become.
Among the many advantages associated with electronic storage is the fact that any given database can be searched for the purpose of retrieving individual data records (e.g., documents) that may be of particular interest to the user. One of the ways to perform this search is to simply determine which data records, if any, contain a certain keyword. This determination is accomplished by comparing the keyword with each record in the database and assessing whether the keyword is present or absent. In addition, database users can search for data records that contain a variety of keyword combinations (e.g., “cats” and “dogs”, etc.). This operation, known as a Boolean search, uses the conjunctions “AND”, “OR”, and “NOT” (among others) to join keywords in an effort to more precisely define and/or simplify the database search. For example, if a user joins the keywords “cats” and “dogs” with the conjunction “AND” and inputs the query “cats AND dogs”, only those records that contain both the term “cats” and the term “dogs” will be retrieved.
The problem with this Boolean search however, is that a computer typically makes use of substantial memory space and computing time to perform logical combinations of sets of documents corresponding to the keyword search results. It is therefore desireable to create a system that performs logical combinations on set elements that is space and computation time efficient.
OBJECTS OF THE INVENTION
It is an object of the present invention to analyze data records in a database.
It is a further object of the present invention to analyze data records in a database by efficiently representing the results of element tests against the database.
It is another object of the present invention to analyze data records in a database by efficiently combining the results of element tests against the database.
It is still a further object of the present invention to analyze data records in a database by efficiently representing the results of keyword tests against the database.
It is still a further object of the present invention to analyze data records in a database by efficiently combining the results of keyword tests against the database.
It is still a further object of the present invention to analyze data records in a database by efficiently representing the results of field type tests against the database.
It is still a further object of the present invention to analyze data records in a database by efficiently combining the results of field type tests against the database.
SUMMARY OF THE INVENTION
The present invention provides a method and apparatus for analyzing a database. This analysis is achieved by representing the subdocument lists of an inverted database with encoded bit strings. The encoded bit strings are space efficient methods of storing the correspondence between terms in the database and their occurrence in subdocuments. Logical combinations of these bit strings are then obtained by identifying the intersection, union, and/or inversion of a plurality of the bit strings. Since keywords for a database search can be identified by selecting the terms of the inverted database, the logical combinations of bit strings represent search results over the database. This technique for generating a search result is computationally efficient because computers combine bit strings very efficiently. The search elements of the present invention are not just limited to keywords. The search elements could also involve types of fields (e.g., date or integer fields) or other extracted entities. These and other aspects and advantages of the present invention will become better understood with reference to the following description, drawings, and appended claims.
REFERENCES:
patent: 3995254 (1976-11-01), Rosenbaum
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4823306 (1989-04-01), Barbic et al.
patent: 5036457 (1991-07-01), Glasser et al.
patent: 5099426 (1992-03-01), Calgren et al.
patent: 5140692 (1992-08-01), Morita
patent: 5191524 (1993-03-01), Pincus et al.
patent: 5249262 (1993-09-01), Baule
patent: 5398199 (1995-03-01), Lefons
patent: 5414425 (1995-05-01), Whiting et al.
patent: 5469354 (1995-11-01), Hatakeyama et al.
patent: 5537586 (1996-07-01), Amram et al.
patent: 5546575 (1996-08-01), Potter et al.
patent: 5566192 (1996-10-01), Moon
patent: 5619199 (1997-04-01), Watts et al.
patent: 5629695 (1997-05-01), Walte et al.
patent: 5799184 (1998-08-01), Fulton et al.
patent: 5826261 (1998-10-01), Spencer
patent: 5848416 (1998-12-01), Tikkanen
patent: 5867821 (1999-02-01), Ballantyne et al.
patent: 5893094 (1999-04-01), Horowitz
patent: 5915249 (1999-06-01), Spencer
patent: 6112204 (2000-08-01), Horowitz
S Kwong et al., Using Multiple Huffman Trees for Compressing Chinese Character Fonts, Paper No. 95-70 (Sep. 6, 1995).
Data Compression (internet posting).
Claritech Corporation
Coby Frantz
Harper Blaney
Jones Day Reavis & Pogue
LandOfFree
Method and apparatus using run length encoding to evaluate a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus using run length encoding to evaluate a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus using run length encoding to evaluate a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2899269