Asynchronously flattening graphs in relational stores
US8799329B2 · kind B2 · utility
3Cited by
19References
19Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 13, 2012 |
| Grant date | Aug 5, 2014 |
| Priority date | — |
| Expiry date | Aug 9, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/284
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An application asynchronously flattens a graph in a relational store to provide fast access to node relationship queries. The application may implement an algorithm that retrieves forward paths of a start node. The algorithm may also retrieve reverse paths of end node. The application may cross-join the forward and reverse paths to determine link paths connecting the start and end nodes. The application may merge the link paths with existing paths. The application may increment path reference counts. The application may store the link paths as a link between the nodes to represent a relationship between the nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.