O9 Solutions, Inc.

Rajeev Karri

Siddarth Wardhan

Amit Agarwal

Koustuv Chatterjee

Devaraya Prabhu

Systems and techniques for a computational unified graph hierarchy model are disclosed herein. A set of source data may be received that may include entity data and relationship data. An entity may be identified in the entity data. A hierarchy may be determined for the entity. An entity graph network may be generated. A non-hierarchical link between the entity and a related entity may be determined. The entity graph network may be updated to include the non-hierarchical link. A set of measures may be generated for a relational link of the entity. A dependency may be configured between the set of measures for the relational link and a second set of measures of a second relational link. A change may be identified to a value of a measure and a dependent entity node measure value may be updated based on a computational effect of the change to the value.

Computational unified graph hierarchy model

A proposed modification to a record of a base data structure is identified, the records of the base data structure sorted by primary key. A type of modification of the proposed modification is identified. A record is added to a differential data structure of the type, the differential data structure record describing the proposed modification. A record is added to a delta data structure sorted by the primary key, the delta data structure record including the primary key value of the record, the type of the proposed modification, and a pointer to the record added to the differential data structure. Data can be fetched using the delta data structure to apply modifications to a set of records requested in the fetch and generate a modified set of records to be returned in a response to the request.

Growing community of inventors

Bengaluru, India

Rajeev Karri