US 2019/0377801 A1 · RELATIONAL DATA MODEL FOR HIERARCHICAL DATABASES

Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data from a hierarchical structure with labels that encode the data's respective position within a data structure that maps hierarchically structured information into relationally structured data. The data structure includes physical nodes, where each physical node represents a data node of the hierarchical structure, and virtual nodes, where each virtual node represents a type of hierarchical relationship between corresponding physical nodes. Each virtual node serves as an expansion node that permits addition and deletion of data within the hierarchical structure without altering labels associated with existing data.

Claims27

Dependent claims

A method for storing and retrieving data in a computer memory system, the method being executed by one or more processors and comprising:

storing, by the one or more processors, data from a hierarchical structure with labels that encode the data's respective position within a data structure that maps hierarchically structured information into relationally structured data, the data structure comprising:
physical nodes, each physical node representing a data node of the hierarchical structure, and
virtual nodes, each virtual node representing a type of hierarchical relationship between corresponding physical nodes, and wherein each virtual node serves as an expansion node that permits addition and deletion of data within the hierarchical structure without altering labels associated with existing data.

A system comprising:

at least one processor;
and a data store coupled to the at least one processor having instructions stored thereon which, when executed by the at least one processor, causes the at least one processor to perform operations comprising:
storing data from a hierarchical structure with labels that encode the data's respective position within a data structure that maps hierarchically structured information into relationally structured data, the data structure comprising:
physical nodes, each physical node representing a data node of the hierarchical structure, and
virtual nodes, each virtual node representing a type of hierarchical relationship between corresponding physical nodes, and wherein each virtual node serves as an expansion node that permits addition and deletion of data within the hierarchical structure without altering labels associated with existing data.

2 more elements

A non-transitory computer readable storage medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform operations comprising:

storing data from a hierarchical structure with labels that encode the data's respective position within a data structure that maps hierarchically structured information into relationally structured data, the data structure comprising:
physical nodes, each physical node representing a data node of the hierarchical structure, and
virtual nodes, each virtual node representing a type of hierarchical relationship between corresponding physical nodes, and wherein each virtual node serves as an expansion node that permits addition and deletion of data within the hierarchical structure without altering labels associated with existing data.

Dependencies are inferred from the claim text.

Relational data model for hierarchical databases

Life of this patent

Relational data model for hierarchical databases

Life of this patent

Abstract

Claims27