# US 10,872,094 B2 · Hierarchical computations in relational database management systems > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,872,094 B2 - Document ID: US10872094B2 - Status: Granted - Kind: B2 - Application number: 15/364,205 - Filed: 2016-11-29 - Published: 2018-05-31 - Granted: 2020-12-22 - Earliest claimed: 2016-11-29 - Assignees: Sap SE - Applicants: Sap SE - Inventors: Gerald Franz; Hannes Jakschitsch; Roland Sedler; Bastian Erler - Web page: https://patentgrep.com/patent/US10872094B2 ## CPC - G06F 16/258: {Data format conversion from or to a database} - G06F 16/211: {Schema design and management} - G06F 16/22: Indexing; Data structures therefor; Storage structures - G06F 16/24578: {using ranking} - G06F 16/248: Presentation of query results - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## 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. ## Claims ### Claim 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. ### Claim 2 (depends on 1) The method of claim 1, wherein the generator function is a table-valued hierarchy function. ### Claim 3 (depends on 1) The method of claim 1, wherein the selection of the generator function includes receiving, from a user, a semantic description of the generator function. ### Claim 4 (depends on 1) The method of claim 1, wherein the generator function is configured to support a plurality of data formats of the source data. ### Claim 5 (depends on 1) 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. ### Claim 6 (depends on 1) The method of claim 1, wherein the navigation result includes a start condition. ### Claim 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. ### Claim 8 (depends on 7) The system of claim 7, wherein the generator function is a table-valued hierarchy function. ### Claim 9 (depends on 7) The system of claim 7, wherein the selection of the generator function includes receiving, from a user, a semantic description of the generator function. ### Claim 10 (depends on 7) The system of claim 7, wherein the generator function is configured to support a plurality of data formats of the source data. ### Claim 11 (depends on 7) 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. ### Claim 12 (depends on 7) The system of claim 7, wherein the navigation result includes a start condition. ### Claim 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. ### Claim 14 (depends on 13) The non-transient computer readable medium of claim 13, wherein the generator function is a table-valued hierarchy function. ### Claim 15 (depends on 13) 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. ### Claim 16 (depends on 13) 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. ### Claim 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. ### Claim 18 (depends on 13) The non-transient computer readable medium of claim 13, wherein the navigation result includes a start condition.