US6728720B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Identifying preferred indexes for databases
Assignee: Individual
•
Filing: 2000-06-13
•
Granted: 2004-04-27
•
Expires: 2020-06-13
Abstract
Abstract Preferred indexes for a relational database are identified. Queries from users are received and a sample of user queries are analysed to identify candidate indexes. Index permutations are identified by processing the candidate indexes in combinations identified from the sample of user queries. A preferred index set is identified by comparing the performance of the index permutations.
Inventors
- 👤 Robert Stephen Gerard Lenzie
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 16:01
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/22; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99933; Y10S707/99935; Y10S707/99941; Y10S707/99942; Y10S707/99943
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
119 words
A method of identifying preferred indexes for a database wherein said database has received queries from users, comprising the steps of: analyzing a sample of user queries to identify candidate indexes; identifying an initial preferred index set by processing said candidate indexes; identifying a first index permutation comprising said initial preferred index set and a separate one of said candidate indexes; identifying a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and identifying a new preferred index set by comparing performance of said first and second index permutations.
Claim 2
Independent Claim
119 words
A method of identifying preferred indexes for a database wherein said database has received queries from users, comprising the steps of: analyzing a sample of user queries to identify candidate indexes; identifying an initial preferred index set by processing said candidate indexes; identifying a first index permutation comprising said initial preferred index set and a separate one of said candidate indexes; identifying a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and identifying a new preferred index set by comparing performance of said first and second index permutations.
Claim 3
Dependent Claim
24 words
A method according to claim 1 , wherein said step of analyzing a sample of user queries includes an identification of indexable predicate sets.
Claim 4
Dependent Claim
25 words
A method according to claim 1 , wherein said step of analyzing a sample of user queries includes an identification of patterns for index-only access.
Claim 5
Dependent Claim
16 words
A method according to claim 1 , wherein said permutations include indexes suitable for index-only access.
Claim 6
Dependent Claim
14 words
A method according to claim 1 , wherein said database is a relational database.
Claim 7
Dependent Claim
21 words
A method according to claim 5 , wherein said preferred index set is identified for each table in said relational database.
Claim 8
Dependent Claim
41 words
A method according to claim 1 , wherein said steps of identifying index permutations and identifying a new preferred index set are repeated, and intermediate results are discarded in response to a change in the rate of preferred index set improvement.
Claim 9
Dependent Claim
23 words
A method according to claim 1 , wherein earlier permutations of indexes chosen progressively guide and restrict the search path of the process.
Claim 10
Dependent Claim
49 words
A method according to claim 1 , wherein said steps of identifying index permutations and identifying a new preferred index set are repeated and a later found preferred index, which has a much higher cost saving than an earlier preferred index causes said earlier preferred index to be discarded.
Claim 11
Dependent Claim
52 words
A method according to claim 1 , wherein said steps of identifying index permutations and identifying a new preferred index set are repeated and a later found preferred index, which has a higher cost saving than an earlier preferred index, causes preferred indexes from said earlier preferred index onwards to be discarded.
Claim 12
Dependent Claim
17 words
A method according to claim 1 , wherein said initial preferred index set comprises one index only.
Claim 13
Dependent Claim
19 words
A method according to claim 11 , wherein said initial preferred index set comprises one single column index only.
Claim 14
Dependent Claim
138 words
Preferred index identification apparatus configured to identify preferred indexes for a database system, comprising: input means configured to receive queries from users; analyzing means configured to analyze a sample of said user queries to identify candidate indexes; identifying means configured to (a) identify an initial preferred index set by processing said candidate indexes; (b) identify a first index permutation comprising said, initial preferred index set and a separate one of said candidate indexes: and (c) identify a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and comparison means configured to compare performances of said first and second index permutations and thereby identify a new preferred index set.
Claim 15
Dependent Claim
138 words
Preferred index identification apparatus configured to identify preferred indexes for a database system, comprising: input means configured to receive queries from users; analyzing means configured to analyze a sample of said user queries to identify candidate indexes; identifying means configured to (a) identify an initial preferred index set by processing said candidate indexes; (b) identify a first index permutation comprising said, initial preferred index set and a separate one of said candidate indexes: and (c) identify a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and comparison means configured to compare performances of said first and second index permutations and thereby identify a new preferred index set.
Claim 16
Dependent Claim
21 words
Apparatus according to claim 13 , wherein said analyzing means analyzes said user queries to identify patterns for index only access.
Claim 17
Dependent Claim
20 words
Apparatus according to claim 13 , wherein said analyzing means analyzes said user queries to identify patterns for index-only access.
Claim 18
Dependent Claim
17 words
Apparatus according to claim 13 , wherein said identifying means identifies index permutations for index only access.
Claim 19
Dependent Claim
15 words
Apparatus according to claim 13 , configured to identify preferred indexes for a relational database.
Claim 20
Dependent Claim
20 words
Apparatus according to claim 17 , configured to identify a preferred index set for each table in said relational database.
Claim 21
Dependent Claim
40 words
Apparatus according to claim 13 , wherein said identifying means is configured to repeatedly identify index permutations and preferred index sets, including means for discarding intermediate results in response to a change in the rate of preferred index set improvement.
Claim 22
Dependent Claim
23 words
Apparatus according to claim 13 , wherein said identifying means is configured to identify an initial preferred index set comprising only one index.
Claim 23
Dependent Claim
18 words
Apparatus according to claim 20 , wherein said initial preferred index set comprises one single column index only.
Claim 24
Dependent Claim
121 words
A computer-readable medium having computer-readable instructions executable by a computer such that, when executing said instructions, a computer will perform the steps of: analyzing a sample of user queries to identify candidate indexes; identifying an initial preferred index set by processing said candidate indexes; identifying a first index permutation comprising said initial preferred index set and a separate one of said candidate indexes; identifying a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and identifying a new preferred index set by comparing performance of said first and second index permutations.
Claim 25
Dependent Claim
121 words
A computer-readable medium having computer-readable instructions executable by a computer such that, when executing said instructions, a computer will perform the steps of: analyzing a sample of user queries to identify candidate indexes; identifying an initial preferred index set by processing said candidate indexes; identifying a first index permutation comprising said initial preferred index set and a separate one of said candidate indexes; identifying a second index permutation by processing said initial preferred index set and one of said candidate indexes such that said second index permutation includes a composite index of said candidate index and an index of said initial preferred index set; and identifying a new preferred index set by comparing performance of said first and second index permutations.
Claim 26
Dependent Claim
29 words
A computer-readable medium having computer-readable instructions according to claim 22 , such that when executing said instructions to analyze a sample of user queries, indexable predicate sets are identified.
Claim 27
Dependent Claim
30 words
A computer-readable medium having computer-readable instructions according to claim 22 , such that when executing said instructions to analyze a sample of user queries, patterns for index-only access are identified.
Claim 28
Dependent Claim
31 words
A computer-readable medium having computer-readable instructions according to claim 22 , such that when executing said instructions to compare the performance of index permutations, indexes suitable for index-only access are included.
Claim 29
Dependent Claim
19 words
A computer-readable medium having computer-readable instructions according to claim 22 , executable within the environment of a relational database.
Claim 30
Dependent Claim
32 words
A computer-readable medium having computer-readable instructions according to claim 26 , such that when executing said instructions, a computer will identify a preferred index set for each table in said relational database.
Claim 31
Dependent Claim
31 words
A computer-readable medium having computer-readable instructions according to claim 22 , such that when executing said instructions said steps of identifying index permutations and identifying a preferred index set are repeated.
Claim 32
Dependent Claim
29 words
A computer-readable medium having computer-readable instructions according to claim 28 , wherein intermediate results are discarded in response to a change in the rate of preferred index set improvement.
Claim 33
Dependent Claim
36 words
A computer-readable medium having computer-readable instructions according to claim 28 , such that when executing said instructions, a computer will stop repeating said repeated steps when new index permutations do not have a substantially increased performance.
References Cited (Backward Citations)
EP0351388A2
Cited
US5404510A
Cited
US5615367A
Cited
US5787416A
Cited
WO1997022939A1
Cited
US6182079B1
Cited
US5870750A
Cited
US5913207A
Cited
US5926813A
Cited
US5960423A
Cited
US6427145B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-04-27 | 2007-10-27 | 2008-04-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-04-27 | 2011-10-27 | 2012-04-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-04-27 | 2015-10-27 | 2016-04-27 | $7700.00 | Window Closed / Lapsed |