|
|
| Line 1: |
Line 1: |
| − | '''Summary of the patent applications from SAP SE on November 30th, 2023'''
| |
| − |
| |
| − | SAP SE has recently filed several patents related to various technologies and applications. These patents cover areas such as monitoring the health status of a service running in an execution environment, private set intersection in two-party computation, evaluating responses from suppliers using machine learning, managing access to personal data based on purposes, improving database query performance through pruning unnecessary table partitions, optimizing query execution by reusing fallback query execution plans, failsafe storage system for data transfer, partition-based locking mechanisms for partitioned database tables, accessing a database collection through a table definition, and automating tests on a user interface application.
| |
| − |
| |
| − | Summary of recent patents filed by SAP SE:
| |
| − |
| |
| − | - Monitoring the health status of a service running in an execution environment.
| |
| − | - Private set intersection in two-party computation using fully homomorphic encryption.
| |
| − | - Evaluating responses from suppliers using a machine learning model.
| |
| − | - Managing access to personal data based on purposes.
| |
| − | - Improving database query performance through pruning unnecessary table partitions.
| |
| − | - Optimizing query execution by reusing fallback query execution plans.
| |
| − | - Failsafe storage system for transferring data between systems.
| |
| − | - Partition-based locking mechanisms for partitioned database tables.
| |
| − | - Accessing a database collection through a table definition.
| |
| − | - Automating tests on a user interface application.
| |
| − |
| |
| − | Notable applications:
| |
| − |
| |
| − | * Private set intersection protocol using fully homomorphic encryption for secure computation.
| |
| − | * Machine learning-based evaluation of supplier responses in sourcing events.
| |
| − | * Managing access to personal data based on purposes for enhanced data privacy.
| |
| − | * Pruning unnecessary table partitions to improve database query performance.
| |
| − | * Reusing fallback query execution plans for optimized query execution.
| |
| − | * Failsafe storage system for secure and efficient data transfer.
| |
| − | * Partition-based locking mechanisms for concurrent DDL and DML operations on partitioned database tables.
| |
| − | * Accessing a database collection through a table definition for efficient data retrieval.
| |
| − | * Automating tests on a user interface application for streamlined testing processes.
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| | ==Patent applications for SAP SE on November 30th, 2023== | | ==Patent applications for SAP SE on November 30th, 2023== |
| | | | |
| Line 40: |
Line 8: |
| | Naveen V | | Naveen V |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This patent application describes systems and methods for automating tests on a user interface application. Here are the key points:
| |
| − |
| |
| − | * The system includes a memory storing processor-executable code and a processing unit to execute the code.
| |
| − | * The code is designed to perform an automation test on a user interface application.
| |
| − | * During the test, the system accesses a web-object, which is a component of the application.
| |
| − | * The system checks if the web-object is already included in an object repository, which is a collection of predefined objects.
| |
| − | * If the web-object is not in the repository, the system creates it and adds it to the repository.
| |
| − | * If the web-object is already in the repository, the system checks if it has any different properties compared to the one in the repository.
| |
| − | * If there are any differences, the system updates the web-object in the repository with the new properties.
| |
| − | * This process ensures that the object repository is always up to date and accurate.
| |
| − | * The patent application also mentions that there are numerous other aspects and details provided in the full description.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | According to some embodiments, systems and methods are provided, including a memory storing processor-executable code; and a processing unit to execute the executable program code to: execute an automation test for a user interface application, wherein execution of the automation test includes accessing a web-object; determine whether the web-object is included in an object repository; in a case it is determined the web-object is not included in the object repository, create the web-object in the object repository; and in a case it is determined the web-object is included in the object repository: determine whether the accessed web-object includes at least one different property from the web-object included in the object repository; and update the web-object included in the object repository with the at least one different property in the accessed web-object. Numerous other aspects are provided.
| |
| | | | |
| | ===ACCESSING SCHEMA-FLEXIBLE DATA BY APPLYING A FIXED SCHEMA ([[US Patent Application 17752050. ACCESSING SCHEMA-FLEXIBLE DATA BY APPLYING A FIXED SCHEMA simplified abstract|17752050]])=== | | ===ACCESSING SCHEMA-FLEXIBLE DATA BY APPLYING A FIXED SCHEMA ([[US Patent Application 17752050. ACCESSING SCHEMA-FLEXIBLE DATA BY APPLYING A FIXED SCHEMA simplified abstract|17752050]])=== |
| Line 64: |
Line 16: |
| | Christian BENSBERG | | Christian BENSBERG |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes a system, method, and computer program product for accessing a database collection.
| |
| − | - An application is able to generate a database collection, which is designed to store documents or records.
| |
| − | - The application also creates a database table definition, which acts as a proxy or adapter for the database collection.
| |
| − | - When a request is received from a client device to execute an operation on the database collection, the request specifies the database table definition.
| |
| − | - The application then accesses the database collection through the database and processes the request using the database table definition.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Disclosed herein are system, method, and computer program product embodiments for accessing a database collection. In some embodiments, an application generates a database collection. The database collection is configured to store documents (e.g., records). The application generates a database table definition. The database table definition is a proxy or adapter for the database collection. The application receives a request to be executed to be executed on the database collection from a client device. The request specifies the database table definition. The application accesses the database collection, via the database, to process the request using the database table definition.
| |
| | | | |
| | ===IMPROVED EXECUTION OF OPERATIONS ON PARTITIONED TABLES ([[US Patent Application 17826974. IMPROVED EXECUTION OF OPERATIONS ON PARTITIONED TABLES simplified abstract|17826974]])=== | | ===IMPROVED EXECUTION OF OPERATIONS ON PARTITIONED TABLES ([[US Patent Application 17826974. IMPROVED EXECUTION OF OPERATIONS ON PARTITIONED TABLES simplified abstract|17826974]])=== |
| Line 82: |
Line 24: |
| | Xiaoke Liu | | Xiaoke Liu |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for improving the execution of data definition language (DDL) and data manipulation language (DML) operations on a partitioned database table using partition-based locking mechanisms.
| |
| − |
| |
| − | * The method involves acquiring locks on table metadata and relevant partition table data to ensure proper execution of overlapping DDL and DML operations.
| |
| − | * When a DML statement is received, an intent exclusive lock is acquired on the table metadata to indicate that the table is being modified.
| |
| − | * When a DDL statement is received, an exclusive metadata lock is acquired on the partitioned table metadata to indicate that the table structure is being modified.
| |
| − | * The second transaction then acquires an intent exclusive lock for the relevant partition table data and an exclusive lock on the table metadata, waiting for the completion of the first transaction's DML operation.
| |
| − | * Once the first transaction is committed, exclusive locks are acquired on the table data and metadata, and the second transaction is executed and committed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Computer-readable media, methods, and systems are disclosed for utilizing partition-based locking mechanisms to improve execution of overlapping data definition language (DDL) and data manipulation language (DML) operations on a partitioned database table. A first node receives a DML statement associated with a first transaction. The first node acquires a intent exclusive lock on table metadata. A second node receives a DDL statement associated with a second transaction and acquires an exclusive metadata lock on the partitioned table metadata. Next, an intent exclusive lock is acquired for the relevant partition table data on the second node and an exclusive lock on table metadata on the second node. The second transaction waits for the DML operation of the first transaction to complete. Then the first transaction is committed. Finally exclusive locks are acquired on table data and metadata and the second transaction is executed and committed.
| |
| | | | |
| | ===THROUGHPUT-OPTIMIZED SCHEMA-FLEXIBLE STORAGE WITH TRANSACTIONAL PROPERTIES ([[US Patent Application 17752066. THROUGHPUT-OPTIMIZED SCHEMA-FLEXIBLE STORAGE WITH TRANSACTIONAL PROPERTIES simplified abstract|17752066]])=== | | ===THROUGHPUT-OPTIMIZED SCHEMA-FLEXIBLE STORAGE WITH TRANSACTIONAL PROPERTIES ([[US Patent Application 17752066. THROUGHPUT-OPTIMIZED SCHEMA-FLEXIBLE STORAGE WITH TRANSACTIONAL PROPERTIES simplified abstract|17752066]])=== |
| Line 102: |
Line 32: |
| | Christian BENSBERG | | Christian BENSBERG |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes a failsafe storage system for transferring data from a source system to a target system.
| |
| − | - The system involves a database that receives a request to insert records of data.
| |
| − | - The database allocates a partition based on the size of the data records.
| |
| − | - Each partition is divided into segments, and the database inserts one or more data records into each segment.
| |
| − | - A create timestamp is added to the header of each data record, indicating the date and time when the record is committed in its respective segment.
| |
| − | - As each record is transmitted to the target system, a delete timestamp is inserted in the segment to mark its completion.
| |
| − | - The system ensures the safe and efficient transfer of data between systems.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Disclosed herein are system, method, and computer program product embodiments for transferring data using a failsafe storage system. In some embodiments, a database receives a request to insert records of data. The records of data are to be transmitted from the source system to the target system. The database allocates a partition in the database based on a size of the plurality of records of data. The database inserts one or more records of data in each segment. The database inserts a create timestamp in each record header of the plurality of records. The create timestamp indicates a date and time when an insert of the one or more records of data is committed in a respective segment. The database inserts a delete timestamp in each segment of records of data, as each respective record of data is transmitted to the target system.
| |
| | | | |
| | ===DATABASE OBJECT VALIDATION FOR REUSING CAPTURED QUERY PLANS ([[US Patent Application 17826007. DATABASE OBJECT VALIDATION FOR REUSING CAPTURED QUERY PLANS simplified abstract|17826007]])=== | | ===DATABASE OBJECT VALIDATION FOR REUSING CAPTURED QUERY PLANS ([[US Patent Application 17826007. DATABASE OBJECT VALIDATION FOR REUSING CAPTURED QUERY PLANS simplified abstract|17826007]])=== |
| Line 122: |
Line 40: |
| | Youngbin Bok | | Youngbin Bok |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes a computer implemented method for receiving a request for a fallback query execution plan in a database system.
| |
| − | - The method evaluates whether an object in the database system and a captured object have the same logical structure.
| |
| − | - If the evaluation indicates that the objects have the same logical structure, the method reuses the fallback query execution plan to execute the query.
| |
| − | - The evaluation process involves identifying the logical structure of the captured object stored in an object definition table.
| |
| − | - The method also obtains the current logical structure of the object and compares it with the logical structure of the captured object.
| |
| − | - The purpose of this method is to optimize query execution by reusing a fallback plan when the object and captured object have the same logical structure.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A computer implemented method can receive a request for a fallback query execution plan of a query in a database system. The query involves an object of the database system. The object is associated with a captured object. The method can evaluate whether the object and the captured object have the same logical structure. Responsive to an indication that the object and the captured object have the same logical structure, the method can reuse the fallback query execution plan to execute the query. The evaluating includes identifying a logical structure of the captured object stored in an object definition table, obtaining a current logical structure of the object, and comparing the logical structure of the captured object with the current logical structure of the object.
| |
| | | | |
| | ===EXTENDED SYNOPSIS PRUNING IN DATABASE MANAGEMENT SYSTEMS ([[US Patent Application 17826986. EXTENDED SYNOPSIS PRUNING IN DATABASE MANAGEMENT SYSTEMS simplified abstract|17826986]])=== | | ===EXTENDED SYNOPSIS PRUNING IN DATABASE MANAGEMENT SYSTEMS ([[US Patent Application 17826986. EXTENDED SYNOPSIS PRUNING IN DATABASE MANAGEMENT SYSTEMS simplified abstract|17826986]])=== |
| Line 141: |
Line 48: |
| | Qingwei Ren | | Qingwei Ren |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This patent application describes a method for improving the performance of database queries by pruning unnecessary table partitions based on statistical information.
| |
| − |
| |
| − | * The method involves receiving a tree partition specification that defines partitions for computed column statistics.
| |
| − | * Based on this specification, partitions are created for the computed column statistics.
| |
| − | * When a request is received to compute statistics for a set of columns, the computed column statistics are marked as invalid if any modifications have been made to the partitioned database.
| |
| − | * The computed column statistics are then refreshed in response to modifications made to the partitioned table, and marked as valid.
| |
| − | * Using the statistics, unnecessary table partitions are pruned, resulting in improved query execution.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Computer-readable media, methods, and systems are disclosed for database table partition pruning based on statistical information associated with non-partition columns. A tree partition specification is received defining partitions for a plurality of computed column statistics. Respective partitions are created for the plurality of computed column statistics based on the tree partition specification. A request is received to compute statistics for a plurality of columns of the plurality of computed column statistics to result in a plurality of computed column statistics. In response to determining that one or more modifications have been made to the partitioned database, the plurality of computed column statistics is marked as invalid. The computed column statistics are refreshed in response to modifications of the partitioned table. Thereafter, the statistics are marked as valid. Unnecessary table partitions are pruned based on the statistics, and the associated query is executed.
| |
| | | | |
| | ===PURPOSE-BASED DATA MANAGEMENT FOR COMPUTING SYSTEMS ([[US Patent Application 17867642. PURPOSE-BASED DATA MANAGEMENT FOR COMPUTING SYSTEMS simplified abstract|17867642]])=== | | ===PURPOSE-BASED DATA MANAGEMENT FOR COMPUTING SYSTEMS ([[US Patent Application 17867642. PURPOSE-BASED DATA MANAGEMENT FOR COMPUTING SYSTEMS simplified abstract|17867642]])=== |
| Line 161: |
Line 56: |
| | Carsten Pluder | | Carsten Pluder |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - This patent application describes systems and processes for managing access to personal data based on the purpose for storing the data.
| |
| − | - The method involves receiving personal data for a data subject and associating one or more purposes to the data.
| |
| − | - The purposes are assigned to specific data categories and may include at least one purpose.
| |
| − | - The personal data is stored in a data storage system and designated as being associated with the purposes.
| |
| − | - Access to the personal data is controlled based on the assigned purposes.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Systems and processes for managing access to personal data based on a purpose for storing the personal data are provided. In a method for managing personal data access, personal data for a data subject corresponding to a first data category is received, and an operation is executed in a purpose agent to associate one or more purposes to the personal data, where the one or more purposes are assigned to the first data category and include at least a first purpose. The personal data may be stored in a data storage system, and the stored personal data may be designated as being associated with the one or more purposes. Access to the personal data may be controlled based on the one or more purposes.
| |
| | | | |
| | ===MACHINE LEARNING ENABLED ENGAGEMENT CONTROLLER ([[US Patent Application 17828377. MACHINE LEARNING ENABLED ENGAGEMENT CONTROLLER simplified abstract|17828377]])=== | | ===MACHINE LEARNING ENABLED ENGAGEMENT CONTROLLER ([[US Patent Application 17828377. MACHINE LEARNING ENABLED ENGAGEMENT CONTROLLER simplified abstract|17828377]])=== |
| Line 179: |
Line 64: |
| | Krishna Hindhupur Vijay Sudheendra | | Krishna Hindhupur Vijay Sudheendra |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for evaluating responses from suppliers in a sourcing event using a machine learning model.
| |
| − |
| |
| − | * The machine learning model analyzes the terms in the first response to determine a performance metric that indicates how competitive the response is compared to a second response from another supplier.
| |
| − | * The method identifies specific terms in the first response that could be modified to improve its competitiveness.
| |
| − | * A user interface is generated to display recommendations for the first supplier to modify the identified terms in their response.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method may include receiving, from a first supplier, a first response to a sourcing event. A machine learning model to may be applied to determine a performance metric for the first response. The machine learning model being trained to determine, based on the terms included in the first response, the performance metric to indicate a relative competitiveness of the first response and a second response from a second supplier. One or more terms from the first response may be identified, based on an output of the machine learning model, as candidates for modification. A user interface may be generated to display a recommendation for the first supplier to modify the one or more terms of the first response. Related systems and computer program products are also provided.
| |
| | | | |
| | ===PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS ([[US Patent Application 17752326. PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS simplified abstract|17752326]])=== | | ===PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS ([[US Patent Application 17752326. PRIVATE SET INTERSECTION FROM BRANCHING PROGRAMS simplified abstract|17752326]])=== |
| Line 197: |
Line 72: |
| | Anselme Tueno | | Anselme Tueno |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application introduces a protocol for private set intersection in two-party computation.
| |
| − | * The protocol allows two parties with private data sets to securely compute the intersection of their sets.
| |
| − | * The result is the only information revealed, ensuring privacy.
| |
| − | * The protocol relies on a branching program evaluated using fully homomorphic encryption (FHE) scheme.
| |
| − | * The FHE scheme allows for non-interactive protocol with extendable functionalities.
| |
| − | * The result of the intersection can be used for further secure computations.
| |
| − | * The communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In an example embodiment, a protocol for private set intersection is introduced that provides for two-party computation. Each party has a private data set and both parties want to securely compute the intersection of their sets, such that only the result is revealed and nothing else. Construction rules are provided that rely on the evaluation of a branching program (BP) using a fully homomorphic encryption (FHE) scheme. Using the properties of an FHR scheme, a non-interactive protocol is built with extendable functionalities. Thus, not only can the intersection be securely computed but the result can be used for further secure computations. Furthermore, the communication overhead for practical applications is independent of the server's set size, allowing for easy scalability.
| |
| | | | |
| | ===CLUSTER AVAILABILITY MONITORING AND ALERTING ([[US Patent Application 17826965. CLUSTER AVAILABILITY MONITORING AND ALERTING simplified abstract|17826965]])=== | | ===CLUSTER AVAILABILITY MONITORING AND ALERTING ([[US Patent Application 17826965. CLUSTER AVAILABILITY MONITORING AND ALERTING simplified abstract|17826965]])=== |
| Line 216: |
Line 79: |
| | | | |
| | Sunyoung HAN | | Sunyoung HAN |
| − |
| |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes a system and method for monitoring the health status of a service running in an execution environment.
| |
| − | - The system executes a first instance of a service and sends a ping to an external port of the instance.
| |
| − | - The ping result is determined and stored as metadata indicating the status of the service instance.
| |
| − | - A health status metric of the service instance is calculated and provided via an internal port of the execution environment.
| |
| − | - Based on the ping result, status, and health status metric, the system determines whether to generate an alert associated with the service instance.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Systems and methods include execution of a first instance of a first service in an execution environment, transmission of a ping to an external port of the first instance, determination of a ping result corresponding to the transmitted ping, storage of metadata indicating a status of the first instance of the first service, determination of a health status metric of the first instance and providing the health status metric via an internal port of the execution environment, and determination of whether to generate an alert associated with the first instance based on the ping result, the status, and the health status metric.
| |
