公开(公告)号：US20230124235A1

公开(公告)日：2023-04-20

申请号：US18067414

申请日：2022-12-16

Applicant: SAP SE

Inventor： Parthasarathy Menon ,  Rohit Jalagadugula

IPC: G06F16/901 ,  G06F16/22

Abstract: A method, a system, and a computer program product for accessing data. A data stream including a plurality of data elements is received. A mapping of the plurality of data elements is generated. Each data element is represented by a data node in the mapping. A linked list of the data nodes with starting and ending elements is generated. Each node is linked to at least another node and stores a count of a data element and the corresponding data element. The count represents a number of times the data element is present in the data stream. Each node is positioned in the generated linked list using the count of each data element. Data elements with a highest count are positioned proximate to the starting element and data elements with a lowest count are positioned proximate to the ending element. Data elements are accessed using the generated mapping.

公开(公告)号：US20250103741A1

公开(公告)日：2025-03-27

申请号：US18475505

申请日：2023-09-27

Applicant: SAP SE

Inventor： Gopi Kishan ,  Rohit Jalagadugula

IPC: G06F21/62 ,  G06N5/022

Abstract: Embodiments of the present disclosure include techniques for controlling access to electronic content. In one embodiment, a user generates content in an electronic document. The system retrieves the content and a profile for the user. A predictive engine determines an access control list comprising a plurality of entries based on the content and the profile. The access control list may be presented to the user, and the system receives a verification from the user of the plurality of entries in the access control list.

公开(公告)号：US12159174B2

公开(公告)日：2024-12-03

申请号：US17948652

申请日：2022-09-20

Applicant: SAP SE

Inventor： Sai Hareesh Anamandra ,  Gopi Kishan ,  Kavitha Krishnan ,  Rohit Jalagadugula ,  Akash Srivastava

IPC: G06F9/54 ,  G06N5/01

Abstract: A method includes receiving a message query from an entity identifier participating in a social network. The message query specifies one or more entities, one or more requirements, and one or more constraints. A set of message query parameters is generated based on the message query. A set of queries for a semantic graph of the social network is generated based on the set of message query parameters. The set of queries is applied to the semantic graph to obtain a set of query results. A message context of the entity identifier is determined based on the set of query results and the set of message query parameters. A set of messages from a message repository is determined based on the message context. The set of messages can be presented on a client computer associated with the entity identifier.

公开(公告)号：US20240386658A1

公开(公告)日：2024-11-21

申请号：US18217748

申请日：2023-07-03

Applicant: SAP SE

Inventor： Kavitha Krishnan ,  Rohit Jalagadugula ,  Gopi Kishan ,  Prateek Garg ,  Maheswar Reddy Pulla ,  Manoj Kumar ,  Diwakar Maurya ,  Shweta Mohanty ,  Sindhu Gangadharan ,  Jayananda A Kotri ,  Kalpana Karunamurthi ,  Amey Haram

IPC: G06T17/00 ,  G06F3/04815 ,  G06F3/0482 ,  G06T13/40

Abstract: Techniques and solutions are provided for facilitating the definition and use of virtual environments. Typically, virtual environments require manual linking of virtual environment components, such as locations, avatars to be displayed, avatar interactions, and actions to be taken upon a selected interaction. This is in addition to actions to define, for example, a visual representation of a virtual location or an avatar. Disclosed techniques provide standardized data objects that can represent components of a virtual environment and relationships between such components. For example, aspects of a virtual environment can be predefined, and a user can configure the virtual environment with particular avatars and particular avatar content (such as media to be rendered for that avatar). In particular aspects, components of a virtual environment, such as avatars, can be determined at runtime, included based on attributes associated with a particular user for whom the virtual environment is to be rendered.

公开(公告)号：US20240296180A1

公开(公告)日：2024-09-05

申请号：US18117284

申请日：2023-03-03

Applicant: SAP SE

Inventor： Rohit Jalagadugula ,  Kavitha Krishnan ,  Sai Hareesh Anamandra ,  Akash Srivastava ,  Gopi Kishan

IPC: G06F16/35 ,  G06F16/36 ,  G06F16/383

CPC classification number: G06F16/355 ,  G06F16/367 ,  G06F16/383

Abstract: A computer-implemented method can receive a message sent from a source entity, perform first pre-processing operations for verifying validity of the message, perform second pre-processing operations for determining a category of the message, extract metadata from the message, generate an enriched message comprising the metadata and the determined category, perform post-processing operations for classifying the enriched message into one of a plurality of event types, broadcast the enriched message to a message broker, and routing, by the message broker, the enriched message to one or more target entities registered an event type into which the message is classified.

公开(公告)号：US11562026B1

公开(公告)日：2023-01-24

申请号：US17460959

申请日：2021-08-30

Applicant: SAP SE

Inventor： Parthasarathy Menon ,  Rohit Jalagadugula

IPC: G06F16/00 ,  G06F16/901 ,  G06F16/22

Abstract: A method, a system, and a computer program product for accessing data. A data stream including a plurality of data elements is received. A mapping of the plurality of data elements is generated. Each data element is represented by a data node in the mapping. A linked list of the data nodes with starting and ending elements is generated. Each node is linked to at least another node and stores a count of a data element and the corresponding data element. The count represents a number of times the data element is present in the data stream. Each node is positioned in the generated linked list using the count of each data element. Data elements with a highest count are positioned proximate to the starting element and data elements with a lowest count are positioned proximate to the ending element. Data elements are accessed using the generated mapping.