Optimization of the order in which the comparisons of the components of a boolean query expression are applied to a database record stored as a byte stream
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 11, 1998
Issued Date -
N/A
app pub date -
Mar 9, 1993
filing date -
Dec 23, 1989
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A database system holds data in the form of a sequence of records, each record comprising one or more fields. The database can be interrogated by a search query, which specifies a particular logical combination of comparisons to be performed on specified fields of each record. Before the search commences, the search query is compiled to produce an optimized sequence of code for search within a record. Each comparison operation is assigned a cost, reflecting the cost in time to retrieve the required fields and to perform the comparisons, and is also assigned a probability, indicating the probability that the comparison will produce a true result. Each logical operation in the search query is then processed, to find the order of handling its arguments that gives the minimum expected cost, and the arguments are re-arranged into that order.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully