Patents by Inventor Roland Sedler
Roland Sedler 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: 11947541Abstract: A method may include receiving a definition of a table user-defined function (TUDF) in a graph query language. The table user-defined function may be created based on the definition. For example, the creation of the table user-defined function may include checking and compiling the definition to generate executable code associated with the table user-defined function. Upon receiving a query including a relational query language statement invoking the table user-defined function, such as a structured query language select statement, the query may be executed on at least a portion of a graph data stored in a database. The executing of the query may include calling the executable code to execute the table user-defined function included in the relational query language statement. Related systems and computer program products are also provided.Type: GrantFiled: September 13, 2022Date of Patent: April 2, 2024Assignee: SAP SEInventors: Gerald Franz, Romans Kasperovics, Umang Rawat, Roland Sedler
-
Publication number: 20240086407Abstract: A method may include receiving a definition of a table user-defined function (TUDF) in a graph query language. The table user-defined function may be created based on the definition. For example, the creation of the table user-defined function may include checking and compiling the definition to generate executable code associated with the table user-defined function. Upon receiving a query including a relational query language statement invoking the table user-defined function, such as a structured query language select statement, the query may be executed on at least a portion of a graph data stored in a database. The executing of the query may include calling the executable code to execute the table user-defined function included in the relational query language statement. Related systems and computer program products are also provided.Type: ApplicationFiled: September 13, 2022Publication date: March 14, 2024Inventors: Gerald FRANZ, Romans Kasperovics, Umang Rawat, Roland Sedler
-
Publication number: 20230418869Abstract: A method may include receiving a workspace definition defining a graph workspace for a heterogeneous graph having a plurality of vertex tables and/or edge tables. Upon validating the workspace definition, the graph workspace for the heterogeneous graph may be created in accordance with the workspace definition. The graph workspace may include a label for each table of the plurality of vertex tables and/or edge tables comprising the heterogeneous graph. Each vertex and edge of the heterogeneous graph may be uniquely identified based on a label of a corresponding table and one or more key attributes. A graph processing algorithm operating on the heterogeneous graph may be executed based on the graph workspace. Related systems and computer program products are also provided.Type: ApplicationFiled: June 23, 2022Publication date: December 28, 2023Inventors: Roland Sedler, Gerald Franz, Matthias Hauck, Hannes Jakschitsch
-
Publication number: 20230185714Abstract: A method may include accessing a cache storing a graph index corresponding to a graph data in response to a transaction operating on the graph data. A cache miss triggered by a change to the underlying graph data may be detected. In response to detecting the cache miss, the graph index may be updated by at least replaying or rewinding one or more other changes made to the graph data by one or more other transactions between a first time of the transaction and a second time of a current version of the graph index in the cache. The graph index may be updated to avoid a full rebuild of the graph index. The transaction may be executed based on the updated graph index. Related systems and computer program products are also provided.Type: ApplicationFiled: December 10, 2021Publication date: June 15, 2023Inventors: Roland Sedler, Umang Rawat, Matthias Hauck, Hannes Jakschitsch, Daniel Ritter
-
Publication number: 20230169114Abstract: A method for ad hoc graph data processing may include receiving, from a client device, a graph processing algorithm defined as a part of an anonymous block. The anonymous block may be a data manipulation language (DML) statement containing the graph processing algorithm. The anonymous block may be compiled. The graph progressing algorithm included in the anonymous block may be executed on at least a portion of a graph data stored in a database. The anonymous block being compiled and executed without generating a database object corresponding to the anonymous block at the database. Related systems and computer program products are also provided.Type: ApplicationFiled: November 29, 2021Publication date: June 1, 2023Inventors: Markus Fath, Hannes Jakschitsch, Roland Sedler
-
Patent number: 11526513Abstract: A method, a system, and a computer program product for querying graph data. A graph workspace object is identified. One or more parameters for executing a declarative language query are identified. Using the identified parameters, the declarative language query is executed on the identified graph workspace object. Based on the executed declarative language query, one or more tables responsive to a request to access graph data stored in a relational database are processed.Type: GrantFiled: January 7, 2020Date of Patent: December 13, 2022Assignee: SAP SEInventors: Gerald Franz, Bastian Erler, Hannes Jakschitsch, Romans Kasperovics, Roland Sedler, Florian Schimmel
-
Patent number: 11500935Abstract: A method for traversing hierarchical data is provided. The method may include generating, based on a source table stored in a database, an index for traversing a graph corresponding to the source table. The source table may identify a parent node for each node in the graph. The generating of the index may include iterating over the source table to generate an inner node map. The inner node map may include at least one mapping identifying one or more children nodes descending from an inner node in the graph. The graph may be traversed based at least on the index. The index may enable the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: January 11, 2019Date of Patent: November 15, 2022Assignee: SAP SEInventors: Bastian Erler, Gerald Franz, Hannes Jakschitsch, Roland Sedler
-
Patent number: 11449550Abstract: A method, a system, and a computer program product for generating graphs using a stored procedure. One or more graph data tables are generated. A procedure having a predetermined name is generated. One or more inputs to the generated procedure includes the generated one or more graph data tables. The generated procedure includes one or more graph objects. The graph data tables are configured to be input to the graph objects. The generated procedure is stored. The stored generated procedure is executed using one or more graph data stored in a graph database.Type: GrantFiled: February 18, 2020Date of Patent: September 20, 2022Assignee: SAP SEInventors: Romans Kasperovics, Gerald Franz, Bastian Erler, Hannes Jakschitsch, Roland Sedler, Florian Schimmel
-
Publication number: 20210256063Abstract: A method, a system, and a computer program product for generating graphs using a stored procedure. One or more graph data tables are generated. A procedure having a predetermined name is generated. One or more inputs to the generated procedure includes the generated one or more graph data tables. The generated procedure includes one or more graph objects. The graph data tables are configured to be input to the graph objects. The generated procedure is stored. The stored generated procedure is executed using one or more graph data stored in a graph database.Type: ApplicationFiled: February 18, 2020Publication date: August 19, 2021Inventors: Romans Kasperovics, Gerald Franz, Bastian Erler, Hannes Jakschitsch, Roland Sedler, Florian Schimmel
-
Patent number: 11068456Abstract: Disclosed herein are system, method, and computer program product embodiments for the translation of a level based format, where each record contains a complete individual path from the highest to the lowest leaf level, to an annotated hierarchy through a generator function which through mapping and encoding on a level-by-level basis, keeping track of sibling links, is able to perform a depth-first pre-ranking order assessment of original data, to produce an annotated hierarchy which may be utilized by a user.Type: GrantFiled: December 13, 2019Date of Patent: July 20, 2021Assignee: SAP SEInventors: Bastian Erler, Gerald Franz, Hannes Jakschitsch, Roland Sedler
-
Publication number: 20210209104Abstract: A method, a system, and a computer program product for querying graph data. A graph workspace object is identified. One or more parameters for executing a declarative language query are identified. Using the identified parameters, the declarative language query is executed on the identified graph workspace object. Based on the executed declarative language query, one or more tables responsive to a request to access graph data stored in a relational database are processed.Type: ApplicationFiled: January 7, 2020Publication date: July 8, 2021Inventors: Gerald Franz, Bastian Erler, Hannes Jakschitsch, Romans Kasperovics, Roland Sedler, Florian Schimmel
-
Publication number: 20210182259Abstract: Disclosed herein are system, method, and computer program product embodiments for the translation of a level based format, where each record contains a complete individual path from the highest to the lowest leaf level, to an annotated hierarchy through a generator function which through mapping and encoding on a level-by-level basis, keeping track of sibling links, is able to perform a depth-first pre-ranking order assessment of original data, to produce an annotated hierarchy which may be utilized by a user.Type: ApplicationFiled: December 13, 2019Publication date: June 17, 2021Inventors: Bastian ERLER, Gerald FRANZ, Hannes JAKSCHITSCH, Roland SEDLER
-
Patent number: 10970265Abstract: A table function can be received at a database system and applied to one or more data sources. The table function can have one or more generic input operators associated with a source data type of the one or more data sources. One or more output operators associated with a return set of data of the table function can be determined at function call compile time from the values passed to one or more generic input operators. The determining of the one or more output parameters can be based on one or more rules specified in the table function definition. The one or more output operators for the table function can be generated at function call compile time.Type: GrantFiled: January 27, 2017Date of Patent: April 6, 2021Assignee: SAP SEInventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
-
Patent number: 10872094Abstract: 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.Type: GrantFiled: November 29, 2016Date of Patent: December 22, 2020Assignee: SAP SEInventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
-
Patent number: 10671581Abstract: Performing hierarchical computations in relational database management systems, where the hierarchical computations are based on tabular input data that builds non-tree topologies by modifying the tabular input data to form tree topologies. One or more nodes, in a hierarchy of nodes, generated from tabular data, can have a non-tree-like topology. One or more attributes of entries in the tabular indexed data structure associated with the one or more nodes having the non-tree-like topology can be modified. The modified attributes can cause the tabular indexed data to form a tree-like topology. The modifying can be based on a type of non-tree-like topology of the one or more nodes having the non-tree-like topology. A navigation function can be selected and applied to the modified tabular indexed data structure to determine a navigation result for traversing the hierarchy of nodes. The navigation result can be provided and the hierarchy traversed.Type: GrantFiled: January 27, 2017Date of Patent: June 2, 2020Assignee: SAP SEInventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
-
Publication number: 20190317963Abstract: A method for traversing hierarchical data is provided. The method may include generating, based on a source table stored in a database, an index for traversing a graph corresponding to the source table. The source table may identify a parent node for each node in the graph. The generating of the index may include iterating over the source table to generate an inner node map. The inner node map may include at least one mapping identifying one or more children nodes descending from an inner node in the graph. The graph may be traversed based at least on the index. The index may enable the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: January 11, 2019Publication date: October 17, 2019Inventors: Bastian Erler, Gerald Franz, Hannes Jakschitsch, Roland Sedler
-
Patent number: 10055440Abstract: Partitioning of a source table of a database to a target table is initiated. Thereafter, a replay table is generated that is populated with triggers for database operations performed on the source table for subsequent replay for the target partitions. Data is later moved (e.g., asynchronously moved, etc.) from the source table to the target table. The database operations are replayed on the target table T subsequent to the moving of the data using the replay table. In addition, the source table is dropped when all of the data has been moved to the target table and there are no operations requiring replay. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: February 24, 2014Date of Patent: August 21, 2018Assignee: SAP SEInventors: Christian Bensberg, Franz Faerber, Lars Fricke, Juchang Lee, Roland Sedler, Andreas Tonder, Emanuel Ziegler
-
Publication number: 20180218018Abstract: A table function can be received at a database system and applied to one or more data sources. The table function can have one or more generic input operators associated with a source data type of the one or more data sources. One or more output operators associated with a return set of data of the table function can be determined at function call compile time from the values passed to one or more generic input operators. The determining of the one or more output parameters can be based on one or more rules specified in the table function definition. The one or more output operators for the table function can be generated at function call compile time.Type: ApplicationFiled: January 27, 2017Publication date: August 2, 2018Inventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
-
Publication number: 20180218055Abstract: Performing hierarchical computations in relational database management systems, where the hierarchical computations are based on tabular input data that builds non-tree topologies by modifying the tabular input data to form tree topologies. One or more nodes, in a hierarchy of nodes, generated from tabular data, can have a non-tree-like topology. One or more attributes of entries in the tabular indexed data structure associated with the one or more nodes having the non-tree-like topology can be modified. The modified attributes can cause the tabular indexed data to form a tree-like topology. The modifying can be based on a type of non-tree-like topology of the one or more nodes having the non-tree-like topology. A navigation function can be selected and applied to the modified tabular indexed data structure to determine a navigation result for traversing the hierarchy of nodes. The navigation result can be provided and the hierarchy traversed.Type: ApplicationFiled: January 27, 2017Publication date: August 2, 2018Inventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler
-
Publication number: 20180150535Abstract: 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.Type: ApplicationFiled: November 29, 2016Publication date: May 31, 2018Inventors: Gerald Franz, Hannes Jakschitsch, Roland Sedler, Bastian Erler