Efficient, in-memory, relational representation for heterogeneous graphs
US12361065B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 25, 2021 |
| Grant date | Jul 15, 2025 |
| Priority date | — |
| Expiry date | Sep 19, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/288
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques are provided herein for efficient representation of heterogeneous graphs in memory. In an embodiment, vertices and edges of the graph are segregated by type. Each property of a type of vertex or edge has values stored in a respective vector. Directed or undirected edges of a same type are stored in compressed sparse row (CSR) format. The CSR format is more or less repeated for edge traversal in either forward or reverse direction. An edge map translates edge offsets obtained from traversal in the reverse direction for use with data structures that expect edge offsets in the forward direction. Subsequent filtration and/or traversal by type or property of vertex or edge entails minimal data access and maximal data locality, thereby increasing efficient use of the graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.