Data structure representation using hash-based directed acyclic graphs and related method
US7895666B1 · kind B1 · utility
37Cited by
1References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 1, 2006 |
| Grant date | Feb 22, 2011 |
| Priority date | — |
| Expiry date | Aug 20, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2221/2107
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method for creating an embedding node. The method includes creating a first hash-based directed acyclic graph (“HDAG”) having a first node, which includes data, and creating a second HDAG having a second node that includes one or more data fields that store the first node.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.