Patents by Inventor Marcus Paradies
Marcus Paradies 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: 11681716Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: August 12, 2020Date of Patent: June 20, 2023Assignee: SAP SEInventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer
-
Publication number: 20200372021Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: August 12, 2020Publication date: November 26, 2020Inventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer
-
Patent number: 10839012Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: March 29, 2018Date of Patent: November 17, 2020Assignee: SAP SEInventors: Jan Bross, Romans Kasperovics, Thomas Fischer, Cornelia Kinder, Marcus Paradies
-
Patent number: 10831771Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.Type: GrantFiled: July 6, 2015Date of Patent: November 10, 2020Assignee: SAP SEInventors: Marcus Paradies, Michael Rudolf, Wolfgang Lehner
-
Patent number: 10810259Abstract: A method for executing a graph algorithm may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: March 29, 2018Date of Patent: October 20, 2020Assignee: SAP SEInventors: Romans Kasperovics, Jan Bross, Thomas Fischer, Marcus Paradies, Cornelia Kinder
-
Patent number: 10776371Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: April 5, 2018Date of Patent: September 15, 2020Assignee: SAP SEInventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer
-
Patent number: 10769188Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: April 5, 2018Date of Patent: September 8, 2020Assignee: SAP SEInventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer, Markus Fath
-
Patent number: 10546021Abstract: A system for processing graph-modeled data in a relational database is provided. The system can include at least one data processor and at least one memory storing instructions that are executed by the at least one data processor. Executing the instructions can result in operations comprising: receiving a request to execute a graph algorithm operating on graph-modeled data stored at a relational database; and executing the graph algorithm within the relational database, the executing comprising use of an adjacency structure within the relational database. Related methods and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: January 30, 2017Date of Patent: January 28, 2020Assignee: SAP SEInventors: Thomas Fischer, Hinnerk Gildhoff, Romans Kasperovics, Cornelia Kinder, Marcus Paradies
-
Patent number: 10503781Abstract: Traversal hooks are based on an event-oriented programming model and provide an expressive mechanism to extend a graph traversal operator with domain-specific coding. A traversal operator can visit (i.e., traversal events) vertices and edges of a graph in an ordered manner. Related apparatus, systems, techniques and articles are also described.Type: GrantFiled: August 6, 2015Date of Patent: December 10, 2019Assignee: SAP SEInventors: Marcus Paradies, Wolfgang Lehner, Michael Rudolf
-
Publication number: 20190311060Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: April 5, 2018Publication date: October 10, 2019Inventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer
-
Publication number: 20190311065Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: April 5, 2018Publication date: October 10, 2019Inventors: Jan Bross, Marcus Paradies, Romans Kasperovics, Thomas Fischer, Markus Fath
-
Publication number: 20190303505Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: March 29, 2018Publication date: October 3, 2019Inventors: Romans Kasperovics, Jan Bross, Thomas Fischer, Marcus Paradies, Cornelia Kinder
-
Publication number: 20190303506Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: March 29, 2018Publication date: October 3, 2019Inventors: Jan Bross, Romans Kasperovics, Thomas Fischer, Cornelia Kinder, Marcus Paradies
-
Patent number: 10394855Abstract: A system for processing graph-modeled data in a relational database is provided. In some implementations, the system performs operations comprising: receiving, from a first user, a request to define a graph algorithm operating on a graph workspace, the graph workspace comprising at least a portion of graph-modeled data stored at a relational database; applying a first security rule associated with the relational database, the applying comprising determining whether the first user has a privilege to define the graph algorithm operating on the graph workspace; and storing the graph algorithm at the relational database, when the first user is determined to have the privilege to define the graph algorithm operating on the graph workspace. Related methods and articles of manufacture, including computer program products, are also provided.Type: GrantFiled: January 30, 2017Date of Patent: August 27, 2019Assignee: SAP SEInventors: Thomas Fischer, Hinnerk Gildhoff, Romans Kasperovics, Cornelia Kinder, Marcus Paradies
-
Publication number: 20180218065Abstract: A system for processing graph-modeled data in a relational database is provided. In some implementations, the system performs operations comprising: receiving, from a first user, a request to define a graph algorithm operating on a graph workspace, the graph workspace comprising at least a portion of graph-modeled data stored at a relational database; applying a first security rule associated with the relational database, the applying comprising determining whether the first user has a privilege to define the graph algorithm operating on the graph workspace; and storing the graph algorithm at the relational database, when the first user is determined to have the privilege to define the graph algorithm operating on the graph workspace. Related methods and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: January 30, 2017Publication date: August 2, 2018Inventors: Thomas Fischer, Hinnerk Gildhoff, Romans Kasperovics, Cornelia Kinder, Marcus Paradies
-
Publication number: 20180218088Abstract: A system for processing graph-modeled data in a relational database is provided. The system can include at least one data processor and at least one memory storing instructions that are executed by the at least one data processor. Executing the instructions can result in operations comprising: receiving a request to execute a graph algorithm operating on graph-modeled data stored at a relational database; and executing the graph algorithm within the relational database, the executing comprising use of an adjacency structure within the relational database. Related methods and articles of manufacture, including computer program products, are also provided.Type: ApplicationFiled: January 30, 2017Publication date: August 2, 2018Inventors: Thomas Fischer, Hinnerk Gildhoff, Romans Kasperovics, Cornelia Kinder, Marcus Paradies
-
Patent number: 9934324Abstract: A system, computer-implemented method, and computer-readable storage medium for generating a block-based index, are provided. A block index is generated where the block index comprises a plurality of blocks and a block corresponds to a section of a graph column that stores a value. A block range vector is also generated for the index where the block range vector includes range information for the block that corresponds to the section of the graph and where the block-based index facilitates traversal of the graph column that searches for the value by constraining the traversal to the section of the graph.Type: GrantFiled: June 18, 2014Date of Patent: April 3, 2018Assignee: SAP SEInventors: Marcus Paradies, Michael Rudolf, Christof Bornhoevd, Wolfgang Lehner
-
Patent number: 9697254Abstract: A system, computer-implemented method, and a computer-readable storage medium for a data graph traversal are provided. The input parameters for traversing the data graph are received. The data graph having a set of vertices and a set of edges are stored in a column based format in a memory cache of a computer device based on the input parameters is traversed. The traversal generates a set of traversed vertices that are the result of the graph traversal.Type: GrantFiled: February 27, 2015Date of Patent: July 4, 2017Assignee: SAP SEInventors: Marcus Paradies, Michael Rudolf, Christof Bornhoevd, Wolfgang Lehner
-
Patent number: 9547728Abstract: A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices.Type: GrantFiled: June 18, 2014Date of Patent: January 17, 2017Assignee: SAP AGInventors: Christof Bornhoevd, Marcus Paradies, Michael Rudolf, Wolfgang Lehner
-
Publication number: 20170011099Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.Type: ApplicationFiled: July 6, 2015Publication date: January 12, 2017Inventors: Marcus Paradies, Michael Rudolf, Wolfgang Lehner