Relational subtree matching for improved query performance
US12210526B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 23, 2023 |
| Grant date | Jan 28, 2025 |
| Priority date | — |
| Expiry date | Oct 23, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2454
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The present disclosure provides techniques and solutions for improved query optimization. A query plan is received, and at least a portion of the query plan is identified to be analyzed for logically equivalent query plans. A signature is generated for the at least a portion of the query plan. One or more query plans are identified that have signature that matches the signature of the at least a portion of the query plan, but where such query plans are logically equivalent, but not identical, to the at least a portion of the query plan. A query plan of the one or more query plans is substituted in the query plan for the at least a portion of the query plan.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.