System and method for graph conditioning with non-overlapping orderable values for efficient graph evaluation
US9081578B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 4, 2011 |
| Grant date | Jul 14, 2015 |
| Priority date | — |
| Expiry date | Apr 19, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9024
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments may include transforming a subgraph into a new subgraph such that, for a given logical operation of the new subgraph, more primitives are grouped under that logical operation relative to the original subgraph. Each primitive may represent a range of values. The primitives of a given logical operation of the transformed subgraph may represent values that overlap. Embodiments may include performing a union operation on the primitives of the given logical operation of the transformed subgraph to generate an ordered set of non-overlapping values. Embodiments may include replacing the given logical operation of the transformed subgraph with information specifying that set. In embodiments, dependent on the given logical operation's complexity, the requisite time to perform a search operation for a value within the ordered set of non-overlapping values is less than the requisite time to perform the given logical operation on its respective primitives.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.