Sap Se

Successfactors, Inc.

Yunfeng Jiang

Wei Zhang

Feng Zhang

Yang Peng

Lai Wei

Haipeng Wu

Junshan Xu

Fen Li

Yueling Wang

Jieying Zhang

Yijun Jiang

Systems and methods described herein relate to the real-time verification of data purges. A first subprocess of a data purging process is executed to purge a plurality of data items. A system accesses purge result data providing an indication of a result of the first subprocess. The system determines, based on the purge result data, that the first subprocess was not executed in accordance with a purge policy associated with the data purging process. In response to determining that the first subprocess was not executed in accordance with the purge policy, the system adjusts a state of the data purging process. A second subprocess of the data purging process is then executed according to the adjusted state.

Automatic data purge verification

Systems and methods described herein relate to the efficient handling of data purge requests in the context of a distributed storage system. A plurality of data purge requests is stored in a first data structure. The data purge requests may be grouped into batches that are processed at least partially in parallel. A first data purge request from the plurality of data purge requests is successfully processed, and is moved from the first data structure to a second data structure. Processing of a second data purge request from the plurality of data purge requests is unsuccessful. The second data purge request is retained in the first data structure. Purge status data is generated based on the first data purge request being in the second data structure and the second data purge request being in the first data structure. The purge status data may be presented at a user device.

Efficient handling of data purge requests

Techniques are described for graph based code performance analysis of software, such as software that is being developed and tested in a development environment. Implementations provide a technique for instrumenting code by adding various annotations into the code. Each annotation may be a function call that executes with the annotated code, but does not alter the behavior and/or functionality of the annotated code apart from outputting call tracking information during execution. The call tracking information generated by annotations can be analyzed to generate a call graph that depicts calling relationships between functions in the code. The call graph can be presented within a user interface and/or automatically analyzed to develop recommendations regarding code coverage for testing, impact information describing how changes to one function impact another function, code optimization recommendations, and so forth.

Graph based code performance analysis

Some embodiments provide a program that collects a set of call stack data associated with a set of test cases executed on an application. The program further generates a set of call graphs based on the set of call stack data. Each call graph in the set of call graphs includes a set of nodes representing a set of functions in the application executed in the corresponding test case in the set of test cases. The program also determines, for each call graph in the set of call graphs, a set of short paths and a set of short sequences in the call graph. The program further receives a notification indicating a modification to a function in the application. The program also determines a subset of the set of test cases to test the modification to the function based on the sets of short paths and the sets of short sequences in the set of call graphs.

Coverage of call graphs based on paths and sequences

Test results can be analyzed and linked using an automated system. In a first embodiment, an error log can be received including log data associated with an error. The log data can be parsed to transform it into a standardized format to allow for easier searching and comparison. Once standardized, an automatic comparison can be made between the parsed log data and previous errors obtained from error logs. If a match is found between the parsed log data and a previous error, then the parsed log data can be linked to the previous error so as to generate a relationship between the two.

Growing community of inventors

Shanghai, China

Yunfeng Jiang