Asserted relationship data structure
US11442990B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 6, 2021 |
| Grant date | Sep 13, 2022 |
| Priority date | — |
| Expiry date | Apr 6, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/285
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system and method for transforming input data in a data graph is structured in such a way that it does not destroy embedded contextual data yet also keeps the number of edges in the data graph sufficiently small in number that computation with respect to the data in the data graph is feasible with existing computational resources on extremely large graph sets. Incoming data is represented as a collection of “cliques” rather than placing each data object into its own node in the graph database. Maintaining the clique structure though the graph build pipeline dramatically reduces the exponential increase in the number of edges in the graph, while also maintaining all of the contextual data presented on the input record.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.