Sap Se

Bjoern Christoph

Carsten Pluder

Marco Valentin

Volker Lehnert

Kathrin Nos

Iouri Loukachev

Joerg Wiederspohn

Bidisha Tripathi

Johannes Gilbert

Suman Kumar Puthadi

Steve Trester

Joerg Heitmann

Robert Girts

Stefan Tex

Shwetank Mishra

A computer-implemented method can receive a search query to search a database table comprising data values organized in rows and columns. The search query includes one or more search entries that specify column names and search criteria associated with the column names. The method can generate hash tables corresponding to selected columns of the database table. A hash table includes hash values and tuples respectively mapped to the hash values. The hash values are unique data values in a selected column of the database table. A tuple includes one or more row indexes corresponding to a specific hash value. Responsive to the search query, the method can search the hash tables to identify result row indexes. The result row indexes and the column names specified by the search entries can locate data values in the database table that satisfy the search criteria specified by the search entries.

Fast table search for visualization of complex hierarchy data

A computer-implemented method can receive a hierarchy table comprising a plurality of records associated with objects organized in a hierarchical structure. The records comprise values corresponding to a plurality of displayable fields and specify value distributions among the objects. The method can specify one or more viewable fields at an input area of a graphical user interface, and display a plurality of nodes and a plurality of directional links connecting the displayed nodes on a display window of the graphical user interface. The displayed nodes represent objects whose associated records have unique combinations of values corresponding to the specified viewable fields. The directional links represent value distributions among objects represented by the displayed nodes. The method can display aggregated value distributed to or from objects represented by the displayed nodes. The viewable fields specify which of the displayable fields are visible on the displayed nodes.

Graphic visualization of complex hierarchy data

A computer-implemented method can create a node-link model from a hierarchy table, which includes a plurality of records associated with a plurality of objects organized in segments. A record includes a unique identifier, a parent reference, and a value distribution for the associated object. The parent reference is the unique identifier of a parent object directing the value distribution to the associated object. The node-link model includes a plurality of nodes representing the objects and links connecting the nodes and representing value distributions between the objects. The method can generate a visual representation of the node-link model in a user interface and receive an input from the user interface. Responsive to the input, the method can change the visual representation to depict a portion of the node-link model based on a viewable scope of the node-link model and one or more viewable fields specified in the input.

Visualization of complex hierarchy data with interactive adjustments

A consent management system (CMS) manages a number of individual consent data records of data subjects. The CMS stores predefined consent templates to be instantiated when an individual consent data record is created. The CMS represents a centralized system for management of individual consent data records that are created, stored, and maintained in relation to provided consent by data subjects for purposes of operations related to stored personal data records by associated application systems. The CMS may run on an on-premise, cloud, or personal device computing platform.

Centralized consent management

A data information framework collects related data sharing characteristics (e.g., personal information, others) revealed by associated purpose information, and reports on that data. The location of the data is not restricted, and can be collected from various locations (e.g. different databases on different computer systems). An engine implements data creation defining links between different stored data structures (e.g., tables) using specific fields. A plurality of tables may be grouped into a smaller number of table clusters to facilitate constructing the data model. The model may be evaluated, enhanced, and/or corrected (e.g., by a user). The model may include fields reflecting the purpose information for the stored data, said fields accessible by the engine during data handling processes. The data model may include descriptions providing data storage location. Purpose information may be mapped to table fields. Field descriptions may be based upon purpose information, with some field values having intelligible text.

Data information framework

Systems and methods are disclosed for creating a read-access log. A business application may send a request for data to a backend system using a communication protocol. At the backend system, the request may be observed and a determination made as to whether the request for data is log-relevant. The determination may be based on a log configuration record associated with the business application making the request. A record may be written in a read-access log when it is determined that the request for data is log-relevant. The log record may include information used to map entity information from the retrieved data to a semantic entity.

Growing community of inventors

Walldorf, Germany

Bjoern Christoph