Abstract: One or more engine instances are executed on each host to form an engine cluster. A plurality of control instances are executed on a first set of hosts to form a control cluster and comprise a control instance leader and one or more control instance followers. In response to a first host indicating a failure of a neighbor host, a pair-wise focused investigation is initiated to check peer-to-peer connections between the first host and the neighbor host. In response to one or more additional hosts indicating failures of neighbor hosts while the pair-wise focused investigation is being performed, a wide investigation is performed to check connections between the control cluster and the plurality of hosts. One or more hosts are added to an eviction list and an eviction protocol is performed to evict the one or more hosts from the engine cluster using the eviction list.

Abstract: Restriction-compliant data replication including receiving a request to replicate a dataset of a database that is stored in a cloud-based data warehouse at a first region of a plurality of geographic regions to a second region of the plurality of geographic regions, wherein the second region is subject to persistent storage restrictions different from restrictions of the first region; selecting a replication policy, applicable to the second region, wherein the replication policy specifies replication restrictions that conform to the persistent storage restrictions of the second region; and replicating the dataset from the first region to the second region, including applying the replication policy to the dataset.

Abstract: A big data analysis system may include a big data repository communicatively coupled to a data accumulation server and a predictive graph processing system. The data accumulation server may be configured to receive information from a plurality of data sources, the information corresponding to user interaction with one or more computing devices associated with an organization via a networked computing system, store the information received from the plurality of sources in the big data repository; and monitor the plurality of data sources to update the data stored in the big data repository. The predictive graph processing system is configured to receive information stored in the big data repository, transform the information received from the big data repository into a predictive graph data set based on a predictive model, and store the predictive graph data set to a visualization data repository.

Abstract: The system and methods described herein provide content recommendations to user equipment timed to reduce interruption of content. A content recommendation application detects output of first content and determines viewing metrics for the first content. Using the determined viewing metrics, the content recommendation application determines whether output of a content recommendation should be blocked. In response to determining that the viewing metrics indicate output of the content recommendation should be blocked, the content recommendation application blocks the content recommendation. Upon receiving an input changing output of the first content to output of a second content, the content recommendation application unblocks and outputs the content recommendation.

Abstract: A data insight system generates an index of precalculated statistical attributes associated with massive data files, such as network log data, that allows improved access to statistical attributes associated with the data items. The system may partition time-based data items into segments based on one or more metadata criteria (e.g., product, status, deployment, environment, version, host, etc.), such as may be selected by a user. The system may then group the data items by time intervals (e.g., 1 minute, 60 minutes, 24 hours, etc.), and calculate one or more statistical attributes (e.g., sum, average, standard deviation, etc.) for each of the segments within each of the time windows. This statistical data may then be stored in association with the corresponding segment and time interval for access by one or more front end software applications.

Abstract: Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.

Abstract: A computer-implemented method comprises receiving a front-end configuration including transition specifications and a back-end configuration including workflow transition rules; receiving a state transition initiated by an interaction via a workflow-based interface associated with the front-end configuration; mapping the state transition to a set of back-end commands; detecting a conflict between the transition specifications and the workflow transition rules; updating state transitions defined in the transition specifications or specified in the workflow transition rules according to conflict resolution rules; causing executing the set of back-end commands over a database of data objects.

Abstract: A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency using a resizable invertible bloom filter. The system may include a resizable invertible bloom filter module that constructs and maintains invertible bloom filters that are resizable based on a number of differences between different snapshots. The resizable invertible bloom filter module may maintain a list of possible sizes for a resizable invertible bloom filter. The resizable invertible bloom filter module may determine and maintain a list of applicable partition sizes, each partition size being a product of a divisor and a resizing factor. If the number of differences exceeds the number of expected differences and results in failure in decoding, the system may retry a larger size in a set of predetermined sizes. The system may continue to try larger sizes until a minimal size required for successful decoding is found.

Abstract: Described herein is a cohort engine that generates a cohort of patients with respect to a selected key patient record. The cohort engine receives, via a first user interface (UI), a key patient record. A patient-cohort generator is launched to determine an initial set of patient records that are to be included in the patient cohort. A second UI is configured to provide the initial set of patient records, where the second UI comprises at least three panes. Upon receiving, via the second UI, an input corresponding to at least one identifier being modified, an equation (i.e., query) is generated based on a combination of identifiers included in the second pane. An updated set of patient records is provided in a third pane of the second UI in response to the at least one identifier being modified.

Abstract: An approach for optimizing statistical query performance. The approach receives a structured query language set. The approach identifies a first set of parameters associated with the statements of the SQL set. The approach creates a merged SQL statement based on one or more matching parameters of SQL statements in the SQL set. The approach binds a second set of parameters associated with the merged SQL statement to the merged SQL statement. The approach generates a SQL statement based on the merged SQL statement. The approach generates a remote SQL statement based on the SQL statement. The approach executes a commit statement on the remote SQL statement.

Abstract: Systems and methods are disclosed for dynamic search interfaces. In one implementation, a search query is received from a user within a content retrieval interface. The search query is processed with respect to a first content source to determine a relevance of the first content source with respect to the search query. Based on a determination that the first content source exceeds a defined relevance threshold, content from the first content source is requested and/or received. The content received from the first content source is presented within the content retrieval interface.

Abstract: An apparatus is described that includes an execution unit to execute a first instruction and a second instruction. The execution unit includes input register space to store a first data structure to be replicated when executing the first instruction and to store a second data structure to be replicated when executing the second instruction. The first and second data structures are both packed data structures. Data values of the first packed data structure are twice as large as data values of the second packed data structure. The execution unit also includes replication logic circuitry to replicate the first data structure when executing the first instruction to create a first replication data structure, and, to replicate the second data structure when executing the second data instruction to create a second replication data structure.

Abstract: Methods, systems, and devices for storing data are provided. To store data, a data storage system may include multiple storage nodes and a support node. Copies of data may be stored in the storage nodes. When the data stored by the storage nodes appears to be inconsistent, metadata from the support node may be used to resolve the inconsistencies. The storage nodes and support node may be integrated into a single chassis. The chassis may be a form factor compliant chassis such as a rack unit compliant chassis for mounting to rack rails.

Abstract: Computer technology for use in a computer system including a database system including a database management sub-system, a primary database and a secondary database, with the secondary database being maintained at least approximately in synchronization with the primary database over time as changes are made to data of the primary database (for example, a database system that includes disaster recovery (DR) features). A statistics update is performed first on a standby database to determine whether query efficiency and/or query optimization really will be substantially improved by performance of the statistics update. If not, then statistics update on the primary database is postponed until a future time.

Abstract: A method for processing a query for data stored in a distributed database includes receiving, at an edge device, the query for data stored in the distributed database from a query device. The method includes causing, by the edge device, the query to be stored on a dynamic ledger maintained by the distributed database. The method includes detecting, by the edge device, that summary data has been stored on the dynamic ledger. The method includes generating, by the edge device, an approximate response to the query based on the summary data stored on the dynamic ledger. The method includes transmitting, to the query device, the approximate response.

Abstract: A system and method of updating Content Server metadata on order to update and re-organize documents in a content management system (i.e., Content Server). A content management system includes a tool for setting Content Server metadata attributes, based in values in the index. Content Server Category Attributes can be set, as can Content Server Classification values, as can Content Server RM Classification values.

Abstract: A computer-implemented method for efficiently estimating the number of unique elements in a collection of elements comprises generating, via hash logic, hash values for each element of the collection of elements. The method further comprises specifying, in a sketch-frequency table, a set of discrete statistical values associated with the hash values and, for each discrete statistical value of the set of discrete statistical values, information indicative of a frequency at which binary representations of the hash values are associated with the discrete statistical value. The cardinality of the collection of elements is estimated based on the sketch-frequency table.

Abstract: Disclosed herein are systems and methods for query processing with restrictions in a database clean room. In an embodiment, a system receives a query directed to a combination of a first source dataset from a first database account of a distributed database and a second source dataset from a second database account of the distributed database. The system generates an approved statements table that contains database statement language that can be executed against the combination of the first and second source datasets. Based on determining that the approved statements table includes the query, the system executes the query to produce results data, and stores the results data in the first database account.

Abstract: Described are a system, method, and computer program product for accelerated database queries using aggregation definitions. The method includes receiving a first set of database queries and parsing each query to produce a plurality of query parameters. The method also includes determining a plurality of frequencies based on a frequency of each query parameter occurring in the first set of database queries. The method further includes generating a plurality of aggregation definitions based on the plurality of query parameters and the plurality of frequencies. The method further includes determining a candidate set of aggregation definitions from the plurality of aggregation definitions, based on a number of queries that would be at least partially satisfied by each aggregation definition of the plurality of aggregation definitions. The method further includes generating an aggregated dataset based on the candidate set of aggregation definitions and performing a database query using the aggregated dataset.

Abstract: A method for enterprise data management includes permitting a first node to join a network having a storage system. Each respective node is assigned a protocol that indicates how the respective node consumes a record. The method also receives a first record from the first node having a first protocol. In response to the receipt, the method determines a first confidence for the first record according to the first node. The method also provides the first record to a second node based on a second protocol assigned to the second node. In response to providing the first record to the second node, the method also determines a second confidence for the first record according to the second node. The method further updates a view associated with the storage system and accessible to each node within the network to indicate the first confidence and the second confidence for the first record.