Hierarchical datacube query plan generation
US12026161B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 7, 2021 |
| Grant date | Jul 2, 2024 |
| Priority date | — |
| Expiry date | Jul 7, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/283
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A multidimensional database query engine processes a query request by forming a logical plan of subqueries for retrieving and assembling the data called for by the query request. A multi-pass analysis identifies a granularity of facts needed to fulfill the query request. A recursive analysis parses the query request and identifies components comprising the full query request. The analysis derives a subquery from each component, and identifies dependencies on other subqueries. The subqueries are arranged in a tree structure based on the dependencies. The tree represents subqueries as nodes, with query operations denoted by parent nodes for the dependent subqueries. The result is a hierarchical tree of subqueries associated based on operations between the subqueries and dependent subqueries descending from their parent subqueries.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.