-
公开(公告)号：US10203952B2
公开(公告)日：2019-02-12
申请号：US14945393
申请日：2015-11-18
Applicant: SAP SE
Inventor： Christopher Schildt , Cornelia Kinder , Alexander Bunte
Abstract: The current subject matter relates to an approach for splitting and rewriting database object bundles into database entities or subunits. For example, cyclical dependencies between a first parameter file and a second parameter file can be identified. The first parameter file can be partitioned into a plurality of subunits comprising a first subunit and a second subunit. The second parameter file, the first subunit, and the second subunit can be reordered to a call order that ensures there are no cyclical dependencies.
-
公开(公告)号：US10114859B2
公开(公告)日：2018-10-30
申请号：US14946664
申请日：2015-11-19
Applicant: SAP SE
Inventor： Romans Kasperovics , Tobias Mindnich , Cornelia Kinder , Christoph Weyerhaeuser , Thomas Fischer
IPC: G06F17/30
Abstract: Based on received input, a vertex table of the database layer and a vertex key column in the vertex table can be identified. The vertex key column defines vertices of a graph representation. Also based on the received input, an edge table of the database layer, an edge key column in the edge table, a source column in the edge table, and a target column in the edge table can be identified. The source column and target column define relationships between vertices of the plurality of vertices. Within a graph workspace object, graph relationships linking the vertices defined by the vertex key column via edges defined by the source column and target column in the edge table can be assigned, and the graph workspace can be generated in a higher level programming layer based on the graph workspace object.
-
公开(公告)号：US20180218065A1
公开(公告)日：2018-08-02
申请号：US15419875
申请日：2017-01-30
Applicant: SAP SE
Inventor： Thomas Fischer , Hinnerk Gildhoff , Romans Kasperovics , Cornelia Kinder , Marcus Paradies
CPC classification number: G06F16/288 , G06F16/9024 , G06F21/6227
Abstract: 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.
-
公开(公告)号：US09600269B1
公开(公告)日：2017-03-21
申请号：US14948990
申请日：2015-11-23
Applicant: SAP SE
Inventor： Jonathan Bregler , Alexander Bunte , Arne Harren , Andreas Kellner , Daniel Kuntze , Vladislav Leonkev , Simon Lueders , Volker Sauermann , Michael Schnaubelt , Le-Huan Stefan Tran , Michael Wintergerst , Cornelia Kinder , Christopher Schildt , Andreas Thumfart , Ralph Debusmann , Andre Hildebrandt
Abstract: A system, a method, and a computer program product for deploying of objects are disclosed. At least one file containing a plurality of artifacts for deploying during runtime of an application is defined. Each artifact in the plurality of artifacts includes at least one object in the plurality of objects required to be deployed during runtime of the application. At least one dependency for at least one artifact in the plurality of artifacts is determined. An execution order for deployment of the plurality of artifacts is generated. The plurality of artifacts is deployed in accordance with the generated execution order.
-
公开(公告)号：US10546021B2
公开(公告)日：2020-01-28
申请号：US15419866
申请日：2017-01-30
Applicant: SAP SE
Inventor： Thomas Fischer , Hinnerk Gildhoff , Romans Kasperovics , Cornelia Kinder , Marcus Paradies
IPC: G06F16/901
Abstract: 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.
-
Patent Agency Ranking
公开(公告)号：US10394855B2
公开(公告)日：2019-08-27
申请号：US15419875
申请日：2017-01-30
Applicant: SAP SE
Inventor： Thomas Fischer , Hinnerk Gildhoff , Romans Kasperovics , Cornelia Kinder , Marcus Paradies
IPC: H04L29/06 , G06F16/28 , G06F16/901 , G06F21/62
Abstract: 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.
-
公开(公告)号：US10114626B2
公开(公告)日：2018-10-30
申请号：US14949256
申请日：2015-11-23
Applicant: SAP SE
Inventor： Jonathan Bregler , Alexander Bunte , Arne Harren , Andreas Kellner , Daniel Kuntze , Vladislav Leonkev , Simon Lueders , Volker Sauermann , Michael Schnaubelt , Le-Huan Stefan Tran , Michael Wintergerst , Cornelia Kinder , Christopher Schildt , Andreas Thumfart , Ralph Debusmann , Andre Hildebrandt , Stefan Baeuerle , Meinolf Block , Klaus Kopecz , Anil K. Goel , Roger Killian-Kehr
Abstract: A system, a method, and a computer program product for deployment of objects are disclosed. Using a deployment infrastructure of a database system, a deployment container for deployment of at least one object at runtime of an application is generated. The container includes at least one artifact for the object and a container schema indicative of at least one dependency associated with the object. At least one deployment privilege is associated based on the container schema with the artifact for the object. The artifact of the deployment container is deployed based on the associated deployment schema during runtime of the application. The container can be an isolated container and an access privilege to an object can be requested based on a synonym for deployment purposes.
-
8.发明授权公开(公告)号：US09547490B1
公开(公告)日：2017-01-17
申请号：US14946707
申请日：2015-11-19
Applicant: SAP SE
Inventor： Christopher Schildt , Cornelia Kinder
CPC classification number: G06F17/30598 , G06F8/433 , G06F17/30289
Abstract: Design time artifacts ordered in a dependency tree according to a call order defined by a database application accessing data in a database can be classified as source and/or sink artifacts. The dependency tree can be traversed in a direction reverse of the call order to determine, for each sink artifact, one or more required source artifacts upon which the sink artifact depends and that is needed to provide correct data inputs for operation of the sink artifact. Based on the traversing, implicitly dependent sink artifacts positioned earlier in the call order that their required source artifacts can be identified, and a new call order can be defined in which all of the required source artifacts for the implicitly dependent sink artifact are called before the implicitly dependent sink artifact.
Abstract translation: 根据由访问数据库中的数据的数据库应用程序定义的调用顺序在依赖关系树中排序的设计时间工件可以分类为源和/或接收器工件。 可以在调用顺序的相反方向上遍历依赖关系树，以便为每个接收器工件确定接收器工件所依赖的一个或多个所需的源工件，并为数据库工件的操作提供正确的数据输入。 基于在呼叫顺序中较早定位的遍历，隐含依赖的接收器工件，可以识别它们所需的源工件，并且可以定义新的调用顺序，其中针对隐式依赖的接收器工件的所有所需源工件在 隐含依赖的水槽神器。
-
公开(公告)号：US20190303506A1
公开(公告)日：2019-10-03
申请号：US15940570
申请日：2018-03-29
Applicant: SAP SE
Inventor： Jan Bross , Romans Kasperovics , Thomas Fischer , Cornelia Kinder , Marcus Paradies
IPC: G06F17/30
Abstract: 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.
-
公开(公告)号：US20190303505A1
公开(公告)日：2019-10-03
申请号：US15940560
申请日：2018-03-29
Applicant: SAP SE
Inventor： Romans Kasperovics , Jan Bross , Thomas Fischer , Marcus Paradies , Cornelia Kinder
IPC: G06F17/30
Abstract: 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.
-
-
-
-
-
-
-
-
-
Search Results
23
records
(took 0.016 seconds)
