Sap Se

Sap Ag

Hendrik C R Lock

Vathsala Arabaghatta Shivarudrappa

Adela Bran

Ivan Schreter

Daniel Booss

Martin Zurmuehl

Reiner P Hammerich

Stefan Kusterer

Ralf Handl

Ramprasadh Kothandaraman

Iouri Loukachev

Janusz Smilek

Vikas Lamba

Pravin Prakash Pattewar

Rajendra Kumar Reddy Koduru

Christian Latzel

Toblas Stolzenberger

Stefan Jetter

Oliver Rooke

Kalyani G

Systems and methods are provided for fragmentation. A dataset including data records is received. Fragments corresponding to the data records are determined. A fragment identifier table is determined which includes a plurality of fragment codes. Each fragment code uniquely corresponds to each fragment. A fragment having a fragment attributes is selected. Based on the fragment attributes, a fragment boundary set is determined. Each fragment boundary set is unique to each fragment code. An encoded limited cardinality dataset is generated based on the fragment boundary sets for visualization on a client device.

Fragmentation for rapid data visualization

Systems and methods are provided for enforcing security requirement rules of an application. A security guard retrieves security annotations associated with an application from a server. Each security annotation is mapped to a security requirement rule. Based on the evaluated application compliance with the security requirement rules, an executable interpretation of the corresponding security requirement rule is implemented.

Enforcing application security requirement rules using security annotations

Systems and methods are provided for limiting cardinality of large datasets. A query is received from a client device. In response to the query, a query dataset comprised of a plurality of data records is retrieved from a remote data store. A fragmentation relation, representation relation, visualization relation, and result relation of the query dataset are determined. The result relation is returned to a client device. Based a selection from the result relation via graphical user interface of the client device, an inverse function is determined for mapping the selection back to the original data relation. A subset of data records corresponding to the selection are retrieved and returned to the client device for rendering in a graphical user interface.

Limiting dataset cardinality for rapid data visualization

Methods, systems, and computer-readable medium storing instructions thereon for implementing methods are directed to facilitating data exchange, such as accessing and operating on data objects, between field applications, such as mobile clients, and dedicated servers by leveraging the features of middleware. An embodiment includes a first server providing a first set of services and data to a mobile client. A first communicating middleware is connected between the first server and the mobile client according to a first communication functionality. A second server provides a second set of services and data according to a second communication functionality that is different from the first communication functionality. A second middleware communicates with the second server according to the second communication functionality, and communicates with the first middleware according to the first communication functionality. The second middleware is connected to the second server and the first middleware.

Method and system for cascading a middleware to a data orchestration engine

The disclosure generally describes computer-implemented methods, software, and systems, including a method for presenting information. A command is identified from an application, the command associated with a configuration model. The identified command is matched to a step defined within the configuration model, each step in the configuration model associated with a request to a particular backend system, wherein each request is associated with at least one representation, the representation defining a visualization associated with the results returned in response to the request. The requested step is added to an analysis path, the analysis path storing a series of ordered steps performed during execution of the application. The request associated with the added step is executed including sending the request to the particular backend system for execution, and the analysis path is updated. A representation object is generated in response to executing the request.

Configurable data analysis using a configuration model

The present disclosure describes computer implemented methods, computer systems, electronic interfaces, mobile computing devices, and computer readable mediums for processing a request from a mobile application residing on a mobile computing device. One method may include receiving the request for data from the mobile application residing on the mobile device at an interface. The method may further include determining an interface service to be executed and executing the interface service. The method can then obtain, at the interface, from the execution of the interface service, a consumption model comprising one or more data models and associated data. The method may further include translating the consumption model and the associated data into an open source protocol, and sending a response from the interface including the translated consumption model and the associated data to the mobile application on the mobile device.

Computer implemented method, computer system, electronic interface, mobile computing device and computer readable medium

The present disclosure describes computer implemented methods, computer systems, and computer readable mediums for recursively testing an OData service. One method may include extracting resource identifiers from an initial service document, and for each of the resource identifiers, retrieving a respective response document from the OData service. The method may further include applying a test function to each of the resource identifiers and respective response documents and recording a result of the test function for each of the resource identifiers. The method may further include recursively extracting new resource identifiers from the response documents and retrieving respective new response documents for each new resource identifier from the OData service until no additional resource identifiers are extracted from the new response documents.

Methods for testing OData services

A method and system are provided for implementing performance monitoring of an application on a mobile device. An instrumentation tool is provided allowing a user to view the entities in an application file for a mobile device and selecting those entities for which performance monitoring is to be implemented. The instrumentation tool adds performance monitoring methods to the application file and generates a new instrumented application file that is transferred to the mobile device. When the instrumented application file is executed on the mobile device, the performance monitoring methods instrumented into the file execute generating data in a performance log file that is stored on the mobile device. This performance log file may be transferred to a remote device for further analysis in addition to viewing the performance log file on the mobile device. The user selected entities for performance monitoring in the application file may be saved to a configuration file that can later be loaded and modified by the user to facilitate further performance monitoring of an application.

Method and system for monitoring performance on a mobile device

Methods and apparatus, including computer program products, for providing a data structure, embodied in a computer-readable medium, implementing a tree of nodes having inner nodes and leaf nodes, and performing a scan of the data structure to identify an entry that satisfies a search criterion. Each leaf node includes a key having a first value representing a starting point of an interval, a second value representing an ending point of an interval, and a third value representing a duration of an interval. Each inner node is a root node of a subtree. Each inner node includes a key having a first value representing a minimum of the starting points of intervals in the corresponding subtree, a second value representing a maximum of the ending points of the intervals in the corresponding subtree, and a third value representing a maximum duration of the intervals in the corresponding subtree.

Growing community of inventors

Linkenheim-Hochstetten, Germany

Hendrik C R Lock