Using a B-tree to store graph information in a database
US11567999B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 21, 2019 |
| Grant date | Jan 31, 2023 |
| Priority date | — |
| Expiry date | May 5, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/22
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.