Sparse mapping of hierarchical subset
US11734243B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 4, 2021 |
| Grant date | Aug 22, 2023 |
| Priority date | — |
| Expiry date | Feb 3, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/282
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a sparse mapping of a data hierarchy. In one aspect, a method includes accessing a data hierarchy of elements, receiving a list of identifiers that each identify an element in the data hierarchy; determining, from the data hierarchy and the list of identifiers, a minimum tree that includes each of the identified elements identified by the list of identifiers additional elements that are not identified by the list of identifiers, where the identified elements and the additional elements define a set of a minimum number of elements necessary to form a path in the data hierarchy that connects all of the identified elements identified by the list of identifiers, and where the elements that belong to the minimum tree are a proper subset of elements of the data hierarchy.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.