Patents by Inventor Robert Brunel
Robert Brunel has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11379451Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: January 13, 2020Date of Patent: July 5, 2022Assignee: SAP SEInventors: Robert Brunel, Norman May
-
Patent number: 11151149Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: October 2, 2019Date of Patent: October 19, 2021Assignee: SAP SEInventors: Robert Brunel, Norman May
-
Patent number: 11010383Abstract: A system and method to receive a query against a plurality of data objects that are sorted, at least conceptually, to follow a hierarchical order and support a preorder traversal arrangement and a postorder traversal arrangement; translate the query into an executable query plan including at least one instance of a hierarchy rearrange operator, the hierarchy rearrange operator to rearrange an input including one or more of the plurality of data objects from one of a preorder traversal arrangement and a postorder traversal arrangement to a corresponding opposite thereof; execute the executable query plan including the at least one instance of the hierarchy rearrange operator; and generate a query result based, at least in part, on the input of the one or more plurality of data objects being rearranged in the respective preorder traversal arrangement and a postorder traversal arrangement.Type: GrantFiled: January 19, 2018Date of Patent: May 18, 2021Assignee: SAP SEInventors: Norman May, Robert Brunel
-
Patent number: 10963442Abstract: A system includes determination, based on a plurality of rows of a table, where each of the plurality of rows associated with a respective row_id represents a respective a node of a hierarchy, row_id pairs of each parent node-child node pair of the hierarchy, execution, based on the row_id pairs, of a depth-first traversal of the hierarchy to sequentially add each row_id of the plurality of rows to a hierarchy index and receive a NODE value associated with the added row_id, and, for each of the plurality of rows, update of a row based on the NODE value associated with the row_id of the row.Type: GrantFiled: January 16, 2019Date of Patent: March 30, 2021Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Patent number: 10769124Abstract: A system includes determination of a first interval encoding of a first version of a hierarchy of nodes, determination of a second version of the hierarchy of nodes, determination of a first difference between the first version of the hierarchy of nodes and the second version of the hierarchy of nodes, and determination of a first swap of two translation ranges of the first interval encoding, the first swap representing the first difference.Type: GrantFiled: August 31, 2015Date of Patent: September 8, 2020Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Publication number: 20200250167Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: January 13, 2020Publication date: August 6, 2020Inventors: Robert Brunel, Norman May
-
Patent number: 10657133Abstract: A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.Type: GrantFiled: January 30, 2018Date of Patent: May 19, 2020Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Patent number: 10565179Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: December 6, 2016Date of Patent: February 18, 2020Assignee: SAP SEInventors: Robert Brunel, Norman May
-
Publication number: 20200042518Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: October 2, 2019Publication date: February 6, 2020Inventors: Robert Brunel, Norman May
-
Patent number: 10545974Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: December 6, 2016Date of Patent: January 28, 2020Assignee: SAP SEInventors: Robert Brunel, Norman May
-
Patent number: 10423623Abstract: A system includes a stored table comprising a plurality of rows and at least one column, each of the plurality of rows associated with a node of a hierarchy, and one of the at least one columns implicity representing a position of a row's associated node within the hierarchy, wherein a Structured Query Language query is received and, response to the query, one or more values of the one of the at least one columns are determined and one or more properties of the hierarchy are determined based on the one or more values.Type: GrantFiled: February 5, 2015Date of Patent: September 24, 2019Assignee: SAP SEInventors: Robert Brunel, Jan Finis, Gerald Franz
-
Publication number: 20190146961Abstract: A system includes determination, based on a plurality of rows of a table, where each of the plurality of rows associated with a respective row_id represents a respective a node of a hierarchy, row_id pairs of each parent node-child node pair of the hierarchy, execution, based on the row_id pairs, of a depth-first traversal of the hierarchy to sequentially add each row_id of the plurality of rows to a hierarchy index and receive a NODE value associated with the added row_id, and, for each of the plurality of rows, update of a row based on the NODE value associated with the row_id of the row.Type: ApplicationFiled: January 16, 2019Publication date: May 16, 2019Inventors: Jan Finis, Robert Brunel
-
Publication number: 20190130001Abstract: A system and method to receive a query against a plurality of data objects that are sorted, at least conceptually, to follow a hierarchical order and support a preorder traversal arrangement and a postorder traversal arrangement; translate the query into an executable query plan including at least one instance of a hierarchy rearrange operator, the hierarchy rearrange operator to rearrange an input including one or more of the plurality of data objects from one of a preorder traversal arrangement and a postorder traversal arrangement to a corresponding opposite thereof; execute the executable query plan including the at least one instance of the hierarchy rearrange operator; and generate a query result based, at least in part, on the input of the one or more plurality of data objects being rearranged in the respective preorder traversal arrangement and a postorder traversal arrangement.Type: ApplicationFiled: January 19, 2018Publication date: May 2, 2019Inventors: Norman May, Robert Brunel
-
Patent number: 10223395Abstract: A system includes determination, based on a plurality of rows of a table, where each of the plurality of rows associated with a respective row_id represents a respective a node of a hierarchy, row_id pairs of each parent node-child node pair of the hierarchy, execution, based on the row_id pairs, of a depth-first traversal of the hierarchy to sequentially add each row_id of the plurality of rows to a hierarchy index and receive a NODE value associated with the added row_id, and, for each of the plurality of rows, update of a row based on the NODE value associated with the row_id of the row.Type: GrantFiled: October 14, 2015Date of Patent: March 5, 2019Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Publication number: 20180165332Abstract: A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.Type: ApplicationFiled: January 30, 2018Publication date: June 14, 2018Inventors: Jan Finis, Robert Brunel
-
Patent number: 9916359Abstract: A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.Type: GrantFiled: June 1, 2015Date of Patent: March 13, 2018Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Publication number: 20180018383Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: December 6, 2016Publication date: January 18, 2018Inventors: Robert Brunel, Norman May
-
Publication number: 20180018375Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: December 6, 2016Publication date: January 18, 2018Inventors: Robert Brunel, Norman May
-
Patent number: 9576011Abstract: A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes.Type: GrantFiled: January 27, 2016Date of Patent: February 21, 2017Assignee: SAP SEInventors: Jan Finis, Robert Brunel
-
Publication number: 20160350380Abstract: A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.Type: ApplicationFiled: June 1, 2015Publication date: December 1, 2016Inventors: Jan Finis, Robert Brunel