Back to results
US 10,872,094 B2Granted
Hierarchical computations in relational database management systems
AssigneeSap SE
InventorsGerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
Life of this patent
Estimating the term…
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.
Claims18
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.
3 more elements
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.
6 more elements
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.
3 more elements
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.
Dependencies are inferred from the claim text.