Combining merkle trees in graph databases
US10242065B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jun 30, 2016 |
| Grant date | Mar 26, 2019 |
| Priority date | — |
| Expiry date | Dec 9, 2036 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/50
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Combining a Merkle tree with a graph database by defining a Merkle tree with each node having a hashed value of the metadata for the node and any children of that node, associating non-hashed data with the hashed data for each node, wherein the non-hashed data has an up-pointer from a child node to any of its immediate parent node, and defining bi-directional edges between the nodes of the Merkle tree having a graph database structure to create a reference for the up-pointers associated with each Merkle tree node. The bi-directional edges with up-pointers along with the Merkle tree hash scheme allows efficient traversal of the tree where the hash values indicate non-changed nodes to prevent traversing the database, and further allows efficient path definitions by allowing database processes to walk up edges.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.