Fast and robust optimization of complex database queries
US7076477B2 · kind B2 · utility
8Cited by
4References
31Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Dec 19, 2002 |
| Grant date | Jul 11, 2006 |
| Priority date | — |
| Expiry date | Jul 29, 2024 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99932
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A robust way is described for optimizing complex data base queries while retaining the optimization speed of heuristic methods. The heuristic join-sequencing algorithm is modified to permit any of, or a combination of: (1) multiple passes of the heuristic algorithm, each with a different metric, producing multiple plans; (2) complex combinations of the criteria by which such heuristics make their choices; and/or (3) backtracking to consider alternatives to any particular decision in the sequence.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.