Systems and methods for maintaining data objects include receiving an event in a queue indicating a change to a data source; obtaining data corresponding to the event from the data source; determining that a monitored item condition defined in a workflow is satisfied based on the data corresponding to the event; generating a data object responsive to the monitored item condition being satisfied; identifying, using a mapping between fields and triggers generated based on the workflow, a trigger defined in the workflow that uses a first field of one or more fields; determining that the value of the first field satisfies a trigger condition of the trigger; and performing, responsive to determining that the value satisfies the trigger condition, an action corresponding to the trigger defined in the workflow.

The present invention generally relates to the field of automated functional testing, and, more particularly, to a method and system for validation of calculation code against calculation specification. Currently the validation is done manually which is time consuming and effort intensive. Embodiments of present disclosure provide an automated method of validation by generating a schema from the calculation specification, retrieving data based on the schema, executing the intermediate calculations, and comparing the result with the output from the calculation code. The method requires minimal manual input and is a fast, simple, resilient and low-code/no-code technique that can be extended to support any type of calculation code and calculation specifications with minimal or no change.

Data on entities and how they are associated with other entities may be aggregated from multiple sources and reconciled. The aggregated data may be presented in a dashboard with a graphical user interface (GUI) that represents entities (e.g., nodes) and associations (e.g., edges) as distinguishable graphical elements that are individually selectable. Different nodes/edges may have distinct graphical representations that correspond with certain characteristics of the nodes/edges. The dashboard may include multiple dynamically-updated panes that may be populated with different information depending on a user's interaction with the GUI and/or depending on information received from various sources. A first entity's connection to or involvement in certain activities may be more readily understood by interactively examining not just the first entity's relationship with a second entity, but also the second entity's relationship with a third entity which is not directly related to the first entity.

Techniques are disclosed relating to processing database transactions that include application operations defined by different object relational mapping (ORM) libraries. A transaction router module executing on a computer system receives, from an application, a request for a first database transaction, where the first database transaction includes first and second application operations. The transaction router module then translates the first application operation to one or more first database operations using a first ORM library and the second application operation to one or more second database operations using a second ORM library. Then, the transaction router module determines one or more database connections for the one or more first database operations and the one or more second database operations. Such techniques may advantageously allow applications to switch between using different persistence frameworks and message broker frameworks without substantial adjustments to application code.

The invention describes a data management system, where a declaration of causal dependency of values is realized by unified abstract connectors directly at the level of data meta-description and, for these purposes, supplements the generally accepted data model with a new fundamental member. The technical result of the invention is a significant increase in the speed of development and reliability of execution of application programs. The technical result is achieved through the use of advanced methods of internal organization and interaction of data model managing structures, as well as by methods of declarative programming.

A system for providing context tree based on data model is disclosed. The system comprises an interface, a processor, and a memory. The interface is configured to receive a data model entry point, and to receive one or more context filters. The processor is configured to determine context tree data based on the one or more context filters and the data model entry point from any context tree provider that has appropriate context tree information. The memory is coupled to the processor and is configured to provide the processor with instructions.

A system and method of creating an entity relationship map includes receiving a stream of lexical matter associated with one or more categories (302) and identifying one or more tokens from the received lexical matter based on the one or more categories (304). A frequency of one or more of unique lexical token and recurring lexical token are determined (306) and one or more outliers based on a standard deviation range associated with the at least one category is eliminated (308). Sentences with the one or more recurring lexical tokens are selected (310) to find one or more lexical neighbors and the entity relationship map is created based on an association between the unique lexical tokens and the at least one lexical neighbor (312).

This disclosure provides systems, methods, and apparatuses, including computer programs encoded on computer storage media, for accessing information associated with an organization hierarchy. In one aspect of the disclosure, a method includes transmitting, from a device to a server in which multiple group models are stored, an access request to access a first group model of the multiple group models. Each group model of the multiple group models is associated with a different organization and includes multiple group data structures, multiple group type data structures, and multiple group member data structures. Each group model is associated with group hierarchy information that indicates a hierarchy associated with the multiple group data structures associated with the group model. The method further includes receiving, at the device and based on the access request, first hierarchy information associated with a first group model. Other aspects and features are also claimed and described.

The present invention relates a method for high-performance traceability query oriented to multi-chain data association, comprising: identifying a target transaction needing the traceability query; searching out all corresponding target chains based on cross-chain transaction data association; making query requests parallelly; and executing the query among the target chains according to a key value of the target transaction and returning query results. The blockchain traceability query method proposed by the present invention is different from serialized block data query conducted in the chain-type structure, and the disclosed cross-chain query operation can be parallelly executed, leading to improved efficiency of traceability query. Opposite to the conventional blockchain where blocks are used as nodes of chains, the present invention directly uses sub blockchains as nodes of the SRB. Since sub blockchains can be dynamically added or removed, the present invention enhances the scalability of the entire system.

There is a need for more effective and efficient detection of cross-data-column relationships. This need can be addressed by, for example, techniques for detecting cross-data-column data relationships that utilize at least one of feature-based similarity models and deep-learning-based similarity models. The cross-data-column data relationships may be displayed to an end-user using a cross-column relationship detection user interface.