Metafutures-based graphed data lookup
US10503782B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Mar 18, 2017 |
| Grant date | Dec 10, 2019 |
| Priority date | — |
| Expiry date | Dec 2, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/90344
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computerized query optimization methodology, computer program product, and electronic device for intelligently optimizing the lookup of graphed data in a data store or distributed across a plurality of databases is disclosed. The method defines an initial metafuture including a plurality of attributes starting with initial data references to determine a starting list of data reference dependencies with respect to metafuture construction functions. In response to a query, a processor initiates a recursive graph traversal of nodes in a graph starting with the initial metafuture as a root node. At each step of the graph traversal, if the metafuture contains an answer, then the process traverses the graph laterally. If there are no further siblings, then the processor initiates a vertical traversal. If all of the children of the metafuture contain answers and the metafuture has no dependency tuples, then an answer of the metafuture is populated by running a graphing function with the answers of the children metafutures, and continuing the traversal either laterally, or vertically if there are no further siblings. If the metafuture is unvisited in the current traversal, then the proce…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.