Abstract: In an approach for maintaining data synchronization, a processor scans a set of data fields at each stage of a data analysis process. A processor generates a relationship tree model, wherein the set of data fields each correspond to a node in the relationship tree model. A processor prunes the relationship tree model. Responsive to an update to a data field of the set of data fields, a processor promulgates the update using the relationship tree model to generate an updated set of insight data. A processor outputs the updated set of insight data.

Abstract: A computer-implemented method includes receiving, at a datastore having a plurality of records of a transaction-monitoring system, a first record representing a first instance of a transaction. The datastore includes a first layer and a second layer. A first record hash code, based on the first record, is compared to a template hash code set that includes one or more template hash codes, where each template hash code corresponds to a respective transaction in a set of one or more known transactions. The first record is inserted into the first layer of the datastore. The first record is inserted into the second layer of the datastore, based at least in part on the first record hash code not being found in the template hash code set.

Abstract: In an approach for maintaining data synchronization, a processor scans a set of data fields at each stage of a data analysis process. A processor generates a relationship tree model, wherein the set of data fields each correspond to a node in the relationship tree model. A processor prunes the relationship tree model. Responsive to an update to a data field of the set of data fields, a processor promulgates the update using the relationship tree model to generate an updated set of insight data. A processor outputs the updated set of insight data.

Abstract: A computer-implanted method for creating a filtered digital entry includes generating, via a processor implementing a trace generation engine, a trace indicative of successful transactions and erroneous transactions. The processor instantiates a plurality of buffers in a buffer pool each configured to record a trace function boundary. The processor then analyzes each buffer in the buffer pool based on the trace function boundary to evaluate whether each function entry in the trace contains an erroneous transaction. If the processor determines that a function entry contains an erroneous transaction, the processor sets an output flag in a call stack map associated with that function. The processor then generates a filtered digital entry based on the call stack map. The filtered digital entry includes only erroneous transaction data from the trace.

Abstract: An on-demand key performance indicator (KPI) monitoring system includes an on-demand KPI structure module configured to dynamically generate an on-demand data structure of a KPI based on a KPI request input to a user interface. The KPI request includes a one or more targeted KPI objects. An agent collector module generates an on-demand KPI collection strategy based on the on-demand data structure. An object monitoring module collects KPI objects based on the on-demand KPI collection strategy. The collected KPI objects include the targeted KPI objects requested by the user, while excluding non-targeted KPI objects excluded from the user's KPI request.

Abstract: A computer-implemented method includes receiving, at a datastore having a plurality of records of a transaction-monitoring system, a first record representing a first instance of a transaction. The datastore includes a first layer and a second layer. A first record hash code, based on the first record, is compared to a template hash code set that includes one or more template hash codes, where each template hash code corresponds to a respective transaction in a set of one or more known transactions. The first record is inserted into the first layer of the datastore. The first record is inserted into the second layer of the datastore, based at least in part on the first record hash code not being found in the template hash code set.

Abstract: A computer-implanted method for creating a filtered digital entry includes generating, via a processor implementing a trace generation engine, a trace indicative of successful transactions and erroneous transactions. The processor instantiates a plurality of buffers in a buffer pool each configured to record a trace function boundary. The processor then analyzes each buffer in the buffer pool based on the trace function boundary to evaluate whether each function entry in the trace contains an erroneous transaction. If the processor determines that a function entry contains an erroneous transaction, the processor sets an output flag in a call stack map associated with that function. The processor then generates a filtered digital entry based on the call stack map. The filtered digital entry includes only erroneous transaction data from the trace.