Abstract: Embodiments maintain a data pool that includes heterogeneous data sets, and receiving a first data batch of a data set from a data source into the data pool. Embodiments determine a current state of the data set based on a data set state diagram including a plurality of data set states, and identify a condition of the first data batch. Embodiments further set a data batch state for the first data batch, based on a data batch state diagram, and update the data batch state of a prior data batch received before the first data batch, based on the condition of the first data batch. Embodiments additionally transition the data set state diagram, based on the condition of the first data batch, to an updated data set state. Embodiments maintain a data state repository storing the data set state for each of the plurality of heterogeneous data sets.

Abstract: Technologies are described here for, among other things, improving search query relevance by executing a query on a search engine, retrieving search-page-data generated from executing the query, the search-page-data including document-titles and universal resource locators (URLs), each document-title being a title of a document associated with a URL, determining relevant-entity-words in the query from an entity relevance score for matching search terms in the query, Domain-URLs, and Domain-Titles, determining relevant-intent-words in the query from an intent-word relevance score based on a number of times a search term appears in the query and the URLs relative to other search terms in the query and the URLs, comparing each of the determined relevant-entity-words and each of the determined relevant-intent-words with a plurality of stored past-user queries, retrieving the plurality of stored past-user search queries including the relevant-entity-words and the relevant-intent-words, and transmitting a set of qu

Abstract: Embodiments of the disclosure provide devices and methods for performing a top-k function. The device can include: a memory comprising a plurality of register files for storing the data elements, the plurality of register files comprising a parent register file and a first child register file associated with the parent register file, wherein the parent register file is associated with: first interface circuitry configured for reading a first parent data element from the parent register file and receiving a first child data element and a second child data element from the first child register file; and first comparison circuitry configured for updating the parent register file and the first child register file based on the first parent data element, the first child data element, and the second child data element according to a given principle.

Abstract: Maintaining, for each target key in a key-value computer database, a signature policy; creating a transaction candidate in the database based on a transaction context submitted to the database by a first user, the transaction candidate comprising: a key, a value comprising a transaction content and a signature of the first user, and a signors list of additional one or more users who are required to co-sign the transaction candidate before the transaction candidate is committed in the database as a transaction, wherein the signors list is automatically computed based on the signature policies of the one or more target keys; collecting a signature for the transaction candidate from at least one of the additional one or more users, according to the signors list; verifying that all signatures required by the signors list have been collected; and in response to the verification, committing the transaction content of the transaction candidate.

Abstract: A processor may identify a plurality of data sets subject to upcoming update processing in a next update cycle. For each of the plurality of data sets, the processor may determine a probability that data included in the data set has changed since a most recent update processing. The processor may exclude a first subset of the plurality of data sets having respective probabilities below a threshold value from the upcoming update processing until the respective probabilities are determined again in a subsequent update cycle. The processor may perform the upcoming update processing on the plurality of the data sets not included in the first subset, where the upcoming update processing may include obtaining updated data from at least one external data source.

Abstract: A processing device receives a request to perform an operation for an object in a storage system. The request includes a custom path for the object that represents the content of the object. The custom path for the object includes a hash value resulting from a hashing algorithm. The processing device determines a data store that stores the one or more other objects having a respective custom path that corresponds to the custom path in the request. Responsive to determining the data store, the processing device performs the operation for the object using the data store.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: A method is disclosed. The method comprises receiving, from one or more search nodes of a distributed system, one or more requests for log data, the one or more search nodes being associated with one or more hot storage systems; identifying, from an index catalog, an indexed portion of the log data stored in a cold storage system of one or more cold storage systems based on at least part of the particular request, the index catalog containing pointers to indexed portions of the log data in the one or more cold storage systems, the indexing being performed by one or more indexing nodes independently from the receiving by the one or more search nodes; and sending the indexed portion to the one or more search nodes for storage in the associated one or more hot storage systems, wherein the method is performed using one or more processors.

Abstract: Systems and methods for validating and reconciliating data with a core reconciliation (recon) device. The core recon device may be configured to receive data from various data stores from various different independent systems. The core recon device may be configured to facilitate users such as agents or brokers to perform cross-platform data queries from all the data stores from all the independent systems. In embodiments, the core recon device may be configured to receive all the cross-platform queried data and then validate and reconcile all the received data into a single processor assignment queue. In the embodiments, the core recon device may be used by the user to identify any particular type of desired discrepancies from all the queried data. In the embodiments, the core recon device may then be used by the user to respectively work towards verifying and rectifying the identified discrepancies stored within the processor assignment queue.

Abstract: In some examples, a computing device is able to communicate with a plurality of data clusters. For example, a first data cluster may be configured with a first version of data cluster software including a first library version, and a second data cluster may be configured with a second version of data cluster software including a second library version that is different from the first. The computing device may execute a single instance of an application to send, based at least on information in the first library version, to the first data cluster, a request for first data, and may receive the first data from the first cluster. Further, the computing device may send, based at least on information in the second library version, second data that is based on the first data to the second data cluster to store the second data with the second data cluster.

Abstract: Techniques for training and/or using a machine learning (ML) algorithm to generate search results are disclosed. An ML algorithm is configured (i) to identify a search starting event and a search terminating event for a search session, where the search session includes multiple navigations across multiple different webpages, and (ii) to derive a dynamic score for the search session, where the dynamic score reflects whether the search session successfully identified an end result that was initially unknown at a time when the search starting event occurred. The trained ML algorithm can then be used during later search sessions to promote better search results and help users identify end targets or results in a faster and more intuitive manner.

Abstract: A method includes receiving, by a first computing entity of a database system, a data set that is organized in rows and columns. The method further includes determining whether to partition the data set based on a parameter associated with the data set. When determining to partition the data set, the method includes determining partitioning parameters for the data set, and partitioning the data set into a plurality of data partitions in accordance with the partitioning parameters. The method further includes determining a first coding scheme for a first data partition and determining a first number of first raw data segments for a first segment group of the first partition based on the coding scheme. The method further includes dividing the first partition to produce the first number of first raw data segments for storage in the database system.

Abstract: Techniques described herein relate to a method for distributed data management. The method may include obtaining data descriptors for an application executing on a data host, performing a dataset policy analysis using the data descriptors to determine a data placement for a dataset associated with the application using a global name repository, performing, based on the data policy analysis, the data placement, and based on the data placement, updating the global name repository.

Abstract: Embodiments of the invention provide an event management device for managing events comprising an event detector configured to detect the occurrence of an event related to data delivered by a data delivery system and to extract user data related to the detected event from a user data storage, the extracted user data comprising user data stored in at least one entry of the user data storage. The event management device further comprising a rule manager configured to determine one or more actions to be executed by applying one or more rules using the extracted user data, the event management device being configured to trigger execution of at least one determined action. The system may further dynamically update the rules using feedback data received for the executed actions.

Abstract: Methods, systems, and computer-readable storage media for receiving, by a messaging system, a message having a key, the key indicating a tenant of a set of tenants, providing, by the messaging system, the message in a partition of a messaging queue, reading, by a service instance, the message from the partition, the service instance being in a set of services instances, each service instance executing a service of a service-based application, and in response to the message, updating, by the service instance, at least a portion of data stored within a database system, the portion of data being associated with the tenant, the database system storing data of each tenant of the set of tenants.

Abstract: A method and system are provided for non-redundant detection of coactively linked nodes/data elements of a network or database topologically disposed in at least one triangularly linked arrangement. The network/database is topologically modelled as a graph having a plurality of vertices connected by edges. A neighborhood is generated in computer readable form for each connected vertex containing all other vertices directly connected thereto as neighbors. Connected vertex are ordered according to degree based on the number of neighbors. A reduced neighborhood is formed for each connected vertex by adaptively removing any lower order neighbor. Triangle neighborhoods are generated responsive to forward detections of common triangle neighbors through pairwise comparisons of reduced neighborhoods for connected vertices and each of their higher order neighbors, and reverse detection for certain connected vertices as triangle neighbors by lower ordered neighbors.

Abstract: The present disclosure describes techniques of providing data consistency for hybrid transactional and analytical processing. Logical logs and log serial numbers (LSNs) associated with the logical logs may be generated based on data captured by a first processing engine. The logical logs and the LSNs may be propagated to a storage subsystem configured to be in communication with the first processing engine and a second processing engine. The LSNs and information indicative of LSN schema versions may be stored and distributed by a metadata service. The first processing engine, the second processing engine, the storage subsystem and the metadata service are modularized, and support a LSN mechanism for maintaining data consistency.

Abstract: A shard of a selected document is identified. A hierarchy of documents including the selected document are to be tagged with metadata in a data store of a search engine so that the related documents are queryable by the metadata using the search engine. The shard specifies a location of the related documents within the data store of the search engine. For each related document, a tagging operation is generated within a script, the tagging operation specifying the metadata, the shard, an identifier of the related document, and an identifier of the selected document. The script including the generated tagging operation for each related document is transmitted to the search engine to execute to tag the related documents in the data store with the metadata and with the selected document as a source of the metadata.

Abstract: In the disclosure of the present innovation the system utilizes artificial intelligence, machine learning, and data analytics for practical and robust digital democracy applications to dynamically predict the most important states to survey in a process. In the present invention, beneficiaries are surveyed about their preferences over various options in these surveyed states. In the current invention, when a state that has not been surveyed occurs, Bayesian methods are used to dynamically predict what a user's ballot would have looked like if that state had been surveyed and Bayesian prediction is then tested, and if the result is found to be robust then a decision is reached using voting logic and economic theory. In the system of the current invention, if the results are not robust, then the process is rerun to determine the most important states to survey.

Abstract: A computer implemented method aggregates change data. The change data formatted in a byte sequence that is used by a target of the change data is received. The change data is stored in a region in an add buffer in a buffer system in response the change data being for an add operation. A determination is made as to whether a collision is present between the change data and stored change data in the add buffer in response to the change data being for a delete operation. A collision location is stored for the region in the add buffer containing the stored change data corresponding to the collision in response to the collision being present. The stored change data in regions in the add buffer in which a set of collisions is absent is sent to the target in response when the change data is to be applied to the target.