Utilization of probabilistic characteristics for reduction of graph database traversals
US10402403B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 6, 2017 |
| Grant date | Sep 3, 2019 |
| Priority date | — |
| Expiry date | Aug 28, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N5/022
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.