Computing resource conservation with balanced traversals and precomputations for connected data sets
US12105711B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 22, 2022 |
| Grant date | Oct 1, 2024 |
| Priority date | — |
| Expiry date | Mar 3, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F21/6218
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Example solutions balance traversals and precomputations for connected data sets subject to access control. When a request for a commutative operation on a connected data set is received, a downwardly recursive process starts with the current hierarchy tier set to a highest hierarchy tier of the request. The process traverses the current hierarchy tier laterally. At each discovered node in the current hierarchy tier, a determination is made whether the requested operation is permitted to include a discovered node. If not, that node and any nodes hierarchically below it are omitted from the operation. That node and its subtree are skipped and the recursion halts for that branch. If, however, the requested operation is permitted to include the node, it is incorporated into the cumulative result and the recursion continues while there remains a lower hierarchy tier. Some examples leverage precomputed aggregates to avoid traversing branches having aggregates.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.