A system receives a request for data stored in an OVSDB database server, wherein the request comprises a JSON RPC request. In response to the request, the system initiates a proxy session by: creating a first communication session between the requesting entity and a proxy daemon, wherein the request indicates a first version corresponding to the first communication session; and creating a second communication session between the proxy daemon and the database server, wherein the second communication session is associated with a second version corresponding to a model used by the database server. The system determines that the first version does not match the second version. The system extracts, from the request, a JSON RPC method and determines that the method requires translation. The system performs, based on the first and second version, translation of a payload of the request, and sends the translated payload to the database server.

Policy-based storage and retrieval combined with a distribution algorithm results in automatic and even distribution of policy-based storage structures across a set of nodes and dynamic, automated homing or ownership of policy-based storage structures. Large numbers of policy-based storage structures may be distributed without manual administration, allowing for rapid creation and destruction of storage structures. The overall load may be distributed and balanced across the server pool. Multiple entries having the same key value in a database- or table-like structure allow for distribution of policy-based storage and retrieval by key value and for queue semantics to be utilized for microqueues in the large database- or table-like structure.

The present disclosure relates to method for responding to a query requesting an intersection being performed. The method includes receiving a query referencing a first set, a second set, and a desired quantile related to the first set from among a plurality of quantiles; generating a data structure including a bottom-k sketch of user identifiers (ids) of the first set and corresponding numerical values of the first data; partitioning the data structure into a plurality of sketches to correspond to the quantiles, respectively; determining an intersection of one of the sketches associated with the desired quantile and a sketch of the second set; and responding to the query based on the intersection.

Disclosed are methods and systems for providing a plurality of data corpuses for anonymization and aggregation. A plurality of data providers validate rules for accessing data by data requesters prior to data availability.

A data intake and query system can manage the search of large amounts of data using one or more processing nodes. When a new processing node is added or becomes available, the node coordinator can reassign duties from one or more processing nodes to the new processing node. The node coordinator can initially assign the new processing node one or more groups of data for backup purposes. At a later time, the node coordinator can reassign the new processing node to the one or more groups of data for searching purposes.

An analytics engine (AE) computing system for analyzing and evaluating data in real-time associated with a performance of parties interacting within a multi-party interaction is provided. The AE system is configured to receive interaction data from a data validation (DV) computing device, retrieve contextual data from a contextual data source, determine a task identifier, and calculate a task score. The AE system is also configured to retrieve normalization model data from a normalization database, compare a plurality of normalization rules to the validated interaction data and the contextual data, and determine at least one normalization factor applies to the task score. The AE system is further configured to normalize the task score based on the at least one normalization factor, calculate an aggregate score using the normalized task score, and store the validated interaction data, the normalized task score, and the aggregate score in an analysis database.

A cardinality query associated with a specific attribute is received. One or more in-scope attribute cardinality partitions is enforced on session record analytics. Vertical data compression is performed to eliminate a time dimension. Horizontal data compression is performed to eliminate one or more out-of-scope attributes. One or more like in-scope session records is aggregated. Magnitudes of each in-scope attribute of each enforced cardinality partition are summed. The sum is returned as a response to the cardinality query.

In an approach for automatic vertical partitioning of fact tables in a distributed query engine a processor analyzes a sample end-user workload of queries to extract filter predicates associated with each of multiple fact tables relating to a big data store. A processor, for each fact table, and for each column in the fact table to which a filter predicate is applied and where coarsification is required, generates a candidate partitioning expression incorporating an adjustment to a coarsification function based on a data distribution of values in the column. A processor scores the candidate partitioning expressions for each fact table based on cost data relating to the sample end-user workload and selects one or more candidate partitioning expressions to optimize partitioning of each fact table with each partition data being placed in a separate directory in a distributed file system.

The present disclosure involves systems, software, and computer implemented methods for providing user interface (UI)-based modifications to adjust and interact with data exchange splits. An example client device can include can identify a data exchange (DE) associated with at least three entities, the DE associated with a total value. A visualization representing the DE can be presented via a UI and can include a chart comprising the total value of the DE exchange divided into value areas that are each associated with a particular entity. In response to a detection of input associated with a selection of an edge between a first and second value area, the combined value area associated with the first and second value areas can be locked. In response to detected movement input associated with the edge, the relative values of the first and second inside the combined value area can be adjusted in the visualization.

Systems and methods are disclosed for executing a query that includes an indication to process data managed by an external data system. The system identifies the external data system that manages the data to be processed and generates a subquery for the external data system indicating that the results of the subquery are to be sent to one worker node of multiple worker nodes. The system instructs the one worker node to distribute the results received from the external data system to multiple worker nodes for processing.