Patent US4438158A successfully refreshed from Google Patents.
Patent US6081804A successfully refreshed from Google Patents.
US6081804A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for performing rapid and multi-dimensional word searches
Assignee: Micro Focus Software Inc
•
Filing: 1994-03-09
•
Granted: 2000-06-27
•
Expires: 2014-03-09
Abstract
Abstract A computer system and method for performing rapid and multi-dimensional word searches upon specification of a search space and specification of a search query. The search space identifies a plurality of objects, whether directly or through means of an index, each object comprising a plurality of words. The search query comprises a plurality of words and a plurality of attributes, the attributes defining the conditions imposed on the search. The search query is processed in two steps. In the first step, a parser evaluates the search query and creates a data structure based on the words and the attributes in the search query and the scope of an index, if the search space includes an index. The parser allows a rich syntax of attributes as well as complex (multi-dimensional) combinations of attributes. In the second step, an evaluator generates a list of objects in the search space which satisfy the search query by scanning the search space with the data structure. The evaluator scans object data where the search space identifies at least one object; scans index data where the search space identifies at least one index of objects and the indexes are sufficient to resolve the search query; and scans complex combinations of object data and index data where index data alone is insufficient to resolve the search query.
Inventors
- 👤 Rodney David Smith
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:06
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90344; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935; Y10S707/99936
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
241 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query; and output means for displaying the list of target objects.
Claim 2
Dependent Claim
241 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query; and output means for displaying the list of target objects.
Claim 3
Dependent Claim
312 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein the evaluating means creates the list of target objects by: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects from the preliminary list of objects where the information specified in the one or more indexes identified by the search space fully resolves the search query; and wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing, at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; and output means for displaying the list of target objects.
Claim 4
Dependent Claim
312 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein the evaluating means creates the list of target objects by: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects from the preliminary list of objects where the information specified in the one or more indexes identified by the search space fully resolves the search query; and wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing, at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; and output means for displaying the list of target objects.
Claim 5
Dependent Claim
322 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein the evaluating means creates the list of target objects by: creating preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects based on the data structure and the objects specified in the preliminary list of objects where the information specified in the one or more indexes identified by the search space falls to fully resolve the search query; and wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries and output means for displaying the list of target objects.
Claim 6
Dependent Claim
322 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating the objects in the group; input means for specifying a search query and a search space, the search query comprising a multidimensional combination of words and attributes, the search space identifying one or more indexes; parser means for creating a data structure based on the search query and the one or more indexes identified by the search space; evaluating means for creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein the evaluating means creates the list of target objects by: creating preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects based on the data structure and the objects specified in the preliminary list of objects where the information specified in the one or more indexes identified by the search space falls to fully resolve the search query; and wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries and output means for displaying the list of target objects.
Claim 7
Independent Claim
226 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query; and displaying the list of target objects.
Claim 8
Independent Claim
226 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query; and displaying the list of target objects.
Claim 9
Independent Claim
296 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing, the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein creating the list of target objects comprises the steps of: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects from the preliminary list of objects where the information specified in the one or more indexes identified by the search space fully resolves the search query; and displaying the list of target objects.
Claim 10
Independent Claim
296 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing, the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein creating the list of target objects comprises the steps of: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects from the preliminary list of objects where the information specified in the one or more indexes identified by the search space fully resolves the search query; and displaying the list of target objects.
Claim 11
Independent Claim
307 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing, the words contained in the search query; a word table for storing, at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or More granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein creating the list of target objects comprises the steps of: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects based on the data structure and the objects specified in the preliminary list of objects where the information specified in the one or more indexes identified by the search space falls to fully resolve the search query; and displaying the list of target objects.
Claim 12
Independent Claim
307 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects and one or more indexes, the objects comprising a plurality of words, the indexes identifying a group of objects and containing information relating to the objects in the group; specifying a search query and a search space, the search query comprising a multi-dimensional combination or words and attributes, the search space identifying one or more indexes; creating a data structure based on the search query and the one or more indexes identified by the search space, wherein the data structure comprises: a lead character table for partially recognizing, the words contained in the search query; a word table for storing, at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or More granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the target objects consisting of objects from the search space which satisfy the search query, wherein creating the list of target objects comprises the steps of: creating a preliminary list of objects based on the data structure and the information specified in the one or more indexes identified by the search space; and creating the list of target objects based on the data structure and the objects specified in the preliminary list of objects where the information specified in the one or more indexes identified by the search space falls to fully resolve the search query; and displaying the list of target objects.
Claim 13
Dependent Claim
210 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects, the objects comprising a plurality of words; input means for specifying a search query and a search space, the search query comprising a multi-dimensional combination of words and attributes, the search space identifying one or more objects; parser means for creating a data structure based on the search query, the data structure comprising: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; evaluating means for creating a list of target objects based on the data structure and the search space, the list of target objects consisting of objects from the search space which satisfy the search query; and output means for displaying the list of target objects.
Claim 14
Dependent Claim
210 words
A computer system for performing rapid, multi-dimensional word searches comprising: storage means for storing one or more objects, the objects comprising a plurality of words; input means for specifying a search query and a search space, the search query comprising a multi-dimensional combination of words and attributes, the search space identifying one or more objects; parser means for creating a data structure based on the search query, the data structure comprising: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; evaluating means for creating a list of target objects based on the data structure and the search space, the list of target objects consisting of objects from the search space which satisfy the search query; and output means for displaying the list of target objects.
Claim 15
Dependent Claim
31 words
The computer system of claim 7 wherein the search query limits the word search of the search space to one or more specified fields within the objects in the search space.
Claim 16
Independent Claim
194 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects, the objects comprising a plurality of words; specifying a search query and a search space, the search query comprising a multi-dimensional combination of words and attributes, the search space identifying one or more objects; creating a data structure based on the search query, the data structure comprising: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the list of target objects consisting of objects from the search space which satisfy the search query; and displaying the list of target objects.
Claim 17
Independent Claim
194 words
A method for performing rapid, multi-dimensional word searches comprising: storing one or more objects, the objects comprising a plurality of words; specifying a search query and a search space, the search query comprising a multi-dimensional combination of words and attributes, the search space identifying one or more objects; creating a data structure based on the search query, the data structure comprising: a lead character table for partially recognizing the words contained in the search query; a word table for storing at least the words contained in the search query; an operator table for storing in post-fix order at least the words contained in the search query and the attributes specifying one or more boolean operators contained in the search query; and a granularity table for storing at least the attributes specifying one or more granularity restrictions contained in the search query, the granularity restrictions requiring the words to appear within one or more granularity boundaries; creating a list of target objects based on the data structure and the search space, the list of target objects consisting of objects from the search space which satisfy the search query; and displaying the list of target objects.
Claim 18
Dependent Claim
31 words
The computer system of claim 9 wherein the search query limits the word search of the search space to one or more specified fields within the objects in the search space.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-06-27 | 2003-12-27 | 2004-06-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-06-27 | 2007-12-27 | 2008-06-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-06-27 | 2011-12-27 | 2012-06-27 | $7700.00 | Window Closed / Lapsed |