Hierarchical computations in relational database management systems

Patent metadata

Field	Value
Publication number	US-10872094-B2
Application number	US-201615364205-A
Country	US
Kind code	B2
Filing date	Nov 29, 2016
Priority date	Nov 29, 2016
Publication date	Dec 22, 2020
Grant date	Dec 22, 2020

Abstract

A selection of a generator function can be received. The generator function can be configured to be applied to source data to form a normalized tabular indexed data structure. The tabular indexed data structure can include a set of hierarchical attributes. A navigation function can be selected to be applied to the tabular indexed data structure to determine a navigation result. The navigation result can be provided to a user.

First claim

What is claimed is:

1. A method to be performed on one or more data processors comprising at least part of a computer system, the method comprising:
receiving, at the one or more data processors, a selection of a generator function of a hierarchal model, the generator function to be applied to source data, the source data comprising hierarchical relationship data corresponding to parent-child relationships, the hierarchical relationship data comprising logical connections within the source data;
generating, by the one or more data processors, a tree hierarchy based at least in part on the hierarchical relationship data corresponding to parent-child relationships;
applying, by the one or more data processors, the generator function to the source data to form a normalized tabular indexed data structure corresponding to the tree hierarchy, the normalized tabular indexed data structure including a set of hierarchical attributes including a rank, a tree size, a parent node rank, and a level in the tree hierarchy;
selecting, by the one or more data processors, a navigation function of the hierarchal model, the navigation function to be applied to the set of hierarchical attributes including the rank, the tree size, the parent node rank, and the level to determine a navigation result comprising a distance between nodes of the normalized tabular indexed data structure corresponding to the tree hierarchy; and
providing, by the one or more data processors, the navigation result by at least appending the distance between nodes to the normalized tabular indexed data structure.

2. The method of claim 1 , wherein the generator function is a table-valued hierarchy function.

3. The method of claim 1 , wherein the selection of the generator function includes receiving, from a user, a semantic description of the generator function.

4. The method of claim 1 , wherein the generator function is configured to support a plurality of data formats of the source data.

5. The method of claim 1 , wherein the distance is between a start node of the source data and a results node of the source data.

6. The method of claim 1 , wherein the navigation result includes a start condition.

7. A system comprising:
at least one processor; and
at least one memory configured to store computer-readable instructions, which, when executed by the at least one processor, cause the at least one processor to perform one or more operations, the operations comprising:
receiving, at the one or more data processors, a selection of a generator function of a hierarchal model, the generator function to be applied to source data, the source data comprising hierarchical relationship data corresponding to parent-child relationships, the hierarchical relationship data comprising logical connections within the source data;
generating, by the one or more data processors, a tree hierarchy based at least in part on the hierarchical relationship data corresponding to parent-child relationships;
applying, by the one or more data processors, the generator function to the source data to form a normalized tabular indexed data structure corresponding to the tree hierarchy, the normalized tabular indexed data structure including a set of hierarchical attributes including a rank, a tree size, a parent node rank, and a level in the tree hierarchy;
selecting, by the one or more data processors, a navigation function of the hierarchal model, the navigation function to be applied to the set of hierarchical attributes including the rank, the tree size, the parent node rank, and the level to determine a navigation result comprising a distance between nodes of the normalized tabular indexed data structure corresponding to the tree hierarchy; and
providing, by the one or more data processors, the navigation result by at least appending the distance between nodes to the normalized tabular indexed data structure.

8. The system of claim 7 , wherein the generator function is a table-valued hierarchy function.

9. The system of claim 7 , wherein the selection of the generator function includes receiving, from a user, a semantic description of the generator function.

10. The system of claim 7 , wherein the generator function is configured to support a plurality of data formats of the source data.

11. The system of claim 7 , wherein the distance is between a start node of the source data and a results node of the source data.

12. The system of claim 7 , wherein the navigation result includes a start condition.

13. A non-transient computer readable medium containing program instructions which, when executed by at least one processor, cause the at least one processor to perform one or more operations, the operations comprising:
receiving, at the one or more data processors, a selection of a generator function of a hierarchal model, the generator function to be applied to source data, the source data comprising hierarchical relationship data corresponding to parent-child relationships, the hierarchical relationship data comprising logical connections within the source data;
generating, by the one or more data processors, a tree hierarchy based at least in part on the hierarchical relationship data corresponding to parent-child relationships;
applying, by the one or more data processors, the generator function to the source data to form a normalized tabular indexed data structure corresponding to the tree hierarchy, the normalized tabular indexed data structure including a set of hierarchical attributes including a rank, a tree size, a parent node rank, and a level in the tree hierarchy;
selecting, by the one or more data processors, a navigation function of the hierarchal model, the navigation function to be applied to the set of hierarchical attributes including the rank, the tree size, the parent node rank, and the level to determine a navigation result comprising a distance between nodes of the normalized tabular indexed data structure corresponding to the tree hierarchy; and
providing, by the one or more data processors, the navigation result by at least appending the distance between nodes to the normalized tabular indexed data structure.

14. The non-transient computer readable medium of claim 13 , wherein the generator function is a table-valued hierarchy function.

15. The non-transient computer readable medium of claim 13 , wherein the selection of the generator function includes receiving, from a user, a semantic description of the generator function.

16. The non-transient computer readable medium of claim 13 , wherein the generator function is configured to support a plurality of data formats of the source data.

17. The non-transient computer readable medium of claim wherein the distance is between a start node of the source data and a results node of the source data.

18. The non-transient computer readable medium of claim 13 , wherein the navigation result includes a start condition.

Assignees

• Sap Se

Inventors

• Franz Gerald
• Jakschitsch Hannes
• Sedler Roland
• Erler Bastian

Classifications

• G06F16/22

  Indexing; Data structures therefor; Storage structures · CPC title

• G06F16/211

  Schema design and management · CPC title

• G06F16/258 Primary

  Data format conversion from or to a database · CPC title

• G06F16/24578

  using ranking · CPC title

• G06F16/248

  Presentation of query results · CPC title