Abstract: There is difficulty in managing and querying highly relational data in large-scale multi-user applications. The interconnected nature of the data entities poses challenges in efficiently storing, retrieving, and manipulating the data. Disclosed are solutions that involve establishing a graph serving layer within the API schema of the application. This layer defines a structured vocabulary for describing the data entities and their interrelations. The data is stored in accordance with this structure, and a global look-aside index is generated to enable efficient querying. The index supports filter and join operations, allowing for targeted retrieval of data based on specific criteria. Queries are received via the API schema, and the relevant data is retrieved using the global look-aside index. The retrieved data is then returned to the requesting application or user via the API schema.

Abstract: A notification platform for distribution of notification content in an on-line social network system, on-line and in near real time, is described. As a new notification is detected in the continuous stream of notifications triggered by time-sensitive events, the near real time notifications distribution system determines member profiles representing potential recipients of the notification by traversing a relationship graph. The relationship graph has nodes representing member profiles, as well as other entities maintained in the on-line social network system. The edges of the relationship graph represent relationships between entities represented by the associated nodes. For each member profile representing a potential recipient of the notification, the near real time notifications distribution system generates a relevance score, which is used to determine whether the notification is to be delivered to the potential recipient.

Abstract: A notification platform for distribution of notification content in an on-line social network system, on-line and in near real time, is described. As a new notification is detected in the continuous stream of notifications triggered by time-sensitive events, the near real time notifications distribution system determines member profiles representing potential recipients of the notification by traversing a relationship graph. The relationship graph has nodes representing member profiles, as well as other entities maintained in the on-line social network system. The edges of the relationship graph represent relationships between entities represented by the associated nodes. For each member profile representing a potential recipient of the notification, the near real time notifications distribution system generates a relevance score, which is used to determine whether the notification is to be delivered to the potential recipient.