Fast processing of path-finding queries in large graph databases
US10810257B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 27, 2015 |
| Grant date | Oct 20, 2020 |
| Priority date | — |
| Expiry date | Oct 26, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9024
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.