Lightweight graph database and searchable datastore
US12265531B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 4, 2021 |
| Grant date | Apr 1, 2025 |
| Priority date | — |
| Expiry date | May 4, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/288
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-implemented method includes receiving a message comprising an origin, a destination and a relationship type for a relationship between the origin and the destination. The message further includes a payload. A first node is created in a graph database for the origin and a second node is created in the graph database for the destination. A relationship is set between the first node and the second node in the graph database based on the relationship type. A node is created in the graph database for the message while preventing the payload from being stored in the graph database. A relationship is created between the first node and the node for the message. The message, including the payload, is stored in a searchable datastore separate from the graph database.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.