Method for optimizing entries for searching an index
August 9, 2016. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesMethod of constant interaction-time clustering applied to document browsing Workload manager for achieving transaction class response time goals in a multiprocessing system Method and system for data retrieval in a distributed system using linked location references on a plurality of nodes System for optimizing correlated SQL queries in a relational database using magic decorrelation Multi-tiered indexing method for partitioned data Entity-relation database System and method of context vector generation and retrieval Computer program product for simulating a contiguous addressable data space Range-based query optimizer Iterative dynamic programming system for query optimization with bounded complexity Patent #: 5671403 InventorAssigneeApplicationNo. 689542 filed on 08/09/1996US Classes:707/2, Access augmentation or optimizing707/102Generating database or data structure (e.g., via user interface)ExaminersPrimary: Amsbury, WayneAttorney, Agent or FirmInternational ClassG06F 017/30AbstractA computerized method optimizes an index of information stored as records of a database in response to queries made to the index. The index is generated by storing index entries in a memory. Each index entry includes a word entry immediately followed by one or more location entries. The word entry encodes a unique portion of information of the records, and the location entries encode occurrences of the unique portion of information in the records. A query phrase is processed, the phrase corresponds to a concatenation of adjacent portions of indexed information. A measure of the amount of time required to process the phrase is recorded in a journal. Periodically, the journal is processed and new index entries are generated for the phrases if the processing of the phrase exceeds some predetermined threshold time.Other References
| |
