公开(公告)号：US20220179627A1

公开(公告)日：2022-06-09

申请号：US17114332

申请日：2020-12-07

Applicant: SAP SE

Inventor： Yash Bagadia ,  Harikrishnan Mangayil ,  Abhishek Nagendra

IPC: G06F8/41 ,  G06F16/901 ,  G06F16/28 ,  G06F9/445

Abstract: Methods and apparatus are disclosed for serializing software objects for loading onto a cloud-hosted tenant, or for other serialized operations. Nodes and edges of a directed graph represent respective software objects and the dependencies among the software objects. A search for strongly connected components reveals cyclic dependencies. Each strongly connected component can be replaced by a contracted node to obtain a condensation of the original directed graph. A topological ordering can be determined for the condensation, and the software objects can be processed or loaded according to the topological ordering. Such ordering provides that software objects of a strongly connected component are processed consecutively while, for all other dependencies, a prerequisite object is processed (loaded) before its dependent object(s). Examples of SAP Analytics Cloud and Data Warehouse Cloud are provided. Exemplary, push and pull loading procedures, topological ordering, and validation are disclosed.

公开(公告)号：US20210349870A1

公开(公告)日：2021-11-11

申请号：US16867304

申请日：2020-05-05

Applicant: SAP SE

Inventor： Harikrishnan Mangayil ,  Srinivas Vinnakota ,  Abhishek Nagendra ,  Sukesh Kaul ,  Subhadeep Khan ,  Yash Bagadia

IPC: G06F16/22 ,  G06F21/62

Abstract: A distribution network may efficiently communicate items/item details in a private manner, with different access rights tailored to various tenants residing within a same or different customer landscape. A first input comprising a flat file with items/item details, is received. A second input comprising permissions entries for per-user, per-item direct access rights (e.g., view, read, write, delete) is also received. The first and second inputs are recursively processed to find nearest ancestors having the direct access rights, with a hash maintained including the nearest ancestors. An effective permitted structure (e.g., tree comprising root and leaf nodes) is generated by recursively adding descendant items having inherited access rights, to the nearest ancestors. Ultimately, descendant item(s) are privately distributed to a user with an access right according to the effective permitted structure. Embodiments may be particularly suited to the private distribution of analytics content (e.g., dimensions, stories, views) to various tenants.

公开(公告)号：US20210328998A1

公开(公告)日：2021-10-21

申请号：US16895988

申请日：2020-06-08

Applicant: SAP SE

Inventor： Harikrishnan Mangayil ,  Abhishek Nagendra ,  Yash Bagadia ,  Subhadeep Khan ,  Jayant Sable ,  Srinivas Vinnakota ,  Sukesh Kaul

IPC: H04L29/06 ,  G06F16/245

Abstract: A distribution network communicates content to tenant groups in a secure manner. An engine of the distribution network receives content created utilizing an application having different customers and partners. The engine also receives: a first identifier indicating a customer of the application with which a tenant is associated, and a second identifier indicating a partner of the application with which the tenant is associated. The engine references a stored database table to correlate the first identifier and the second identifier. Based upon the first identifier and the second identifier, the engine evaluates whether the tenant is to be provided access to the content. The engine may provide the tenant with the content according to an access right determined from the first identifier and the second identifier. Certain embodiments may find particular use disseminating content to new tenants of a customer, based upon prior distribution to other tenants of that customer.

公开(公告)号：US20190179928A1

公开(公告)日：2019-06-13

申请号：US15926856

申请日：2018-03-20

Applicant: SAP SE

Inventor： Rahul Tiwari ,  Harikrishnan Mangayil ,  Nikita Jain ,  Rakesh Kelappan

IPC: G06F17/30

Abstract: Indexing natural language processing, a request is received from a user to access a document at a server, the server routes the request to an indexing server. A validation service checks if the CUID of the document is available in the indexing server repository or a file system associated with the indexing server. If the CUID of dataset exists, determine if a timestamp of the new document matches the timestamp of the previously indexed document. Upon determining that the above conditions are fulfilled, the previously indexed data is returned to the server. If it is determined that the above conditions do not match, then a transformation service is invoked at the indexing server. The transformation service compares a hash value of a dataset. If the transformation service determines that the hash value of a dataset in the document is not available, an indexing service is invoked to index the document.