Abstract: Update-anywhere replication of queuing operations on a replicated message queue is performed. A dequeue ready time (“ready time”) is associated by each participating persistent storage server with a queue message to be dequeued. Unless a queue message is already locked by a distributed dequeue transaction, a participating leader PSS initiates a distributed dequeue transaction for the queue message once the ready time for the queue message is reached, subject to certain conditions. An initiator PSS is in effect designated for a queue message; the initiator PSS associates a desired ready time for the queue message. The designated PSS is referred to herein as the primary leader PSS and the ready time the primary PSS associates with queue message is referred as the primary ready time. The other participating leader PSSs are backup leader PSSs which serve as backups for dequeuing a queue message. Each backup leader PSS associates a later “backup ready time” with the queue message.

Abstract: A system monitors database agents associated with DBMSs running on servers, for example, servers of an organization connected by a network. The system determines whether each database agent is running according to a schedule and whether the database agent is running the correct version of a script. The system may generate a report describing differences between database agents that are running on database instances and a master configuration of database agents representing the expected configuration of the database agent. If a database instance is executing a configuration of a database agent that is different from the master configuration of the database agent, the system updates the database agent executing on the database instance to ensure that the configuration matches the master configuration.

Abstract: Methods for distributed histogram computation in a framework utilizing data stream sketches and samples are performed by systems and devices. Distributions of large data sets are scanned once and processed by a computing pool, without sorting, to generate local sketches and value samples of each distribution. The local sketches and samples are utilized to construct local histograms on which cardinality estimates are obtained for query plan generation of distributed queries against distributions. Local statistics of distributions are also merged and consolidated to construct a global histogram representative of the entire data set. The global histogram is utilized to determine a cardinality estimation for query plan generation of incoming queries against the entire data set. The addition of new data to a data set or distribution involves a scan of the new data from which new statistics are generated and then merged with existing statistics for a new global histogram.

Abstract: Techniques for modifying an application data set may include receiving a request to modify a storage group of logical devices used by an application; and performing processing that modifies, in accordance with the request, the storage group and an existing remote replication configuration. The processing may include verifying that the logical devices of the storage group are protected by remote replication performed in accordance with the existing remote replication configuration; analyzing the existing remote replication configuration and generating analysis information; performing, in accordance with the analysis information and the request, a first modification to the existing remote replication configuration; and performing, in accordance with the request, a second modification to the storage group. The request may add logical devices to the storage group or remove logical devices from the storage group and accordingly modify the existing remote replication configuration.

Abstract: Systems and methods include detection of changes to data of a plurality of source objects of a source system, replicating the data changes to corresponding ones of the plurality of target objects, and, during the detection of changes to data and the replication of the data changes: detecting a first change to a first source object, identifying a first maintenance event based on the detected first change; determining a first one or more solutions to resolve the first maintenance event; presenting the first maintenance event and the first one or more solutions to resolve the first maintenance event to a user; receiving an indication from the user of a first solution of the first one or more solutions to resolve the first maintenance event; and, in response to the indication, executing the first solution.

Abstract: A system and method for facilitating a migration engine to migrate data items in a data directory from a source system to a destination system over multiple migration passes are disclosed. A state file can be used to track migration states of data items during the life cycle of the migration. The state file can be generated and updated by a plugin to the migration engine. During a migration pass, the state file can be loaded into the memory to influence the migration by the migration engine. Prior to the migration pass, migration profile specifying one or more migration actions can be invoked by a migration routine. The invocation of the migration profile can cause the state file to be modified to perform the migration actions accordingly.

Abstract: A system and method for continuous processing of data streams residing in distributed data sources. The method includes: receiving a plurality of data streams from a plurality of distributed data sources; processing each of the plurality of data streams using a plurality commands, the plurality commands are executed in parallel using a graph execution engine; and transporting, through a transport layer, each of the plurality of data streams using the plurality commands to at least one data sink.

Abstract: There is provided a system for dynamically updating data in dataset, comprising: at least one processor executing a code for: receiving an indication of trigger for a change of a first cell of cells of a dataset, updating the first cell according to the trigger, determining a second cell dependent on the first cell, sending to the second cell, an event message indicating the update of the first cell, locking a column of cells that include the second cell and other cells, and re-computing values of the second cell and other cells of the locked column, by performing a batch update of the cells of the locked column according to the event message, and according to additional event messages sent to the cells of the locked column that received before the locking and/or received during the locking.

Abstract: Methods, systems, and computer-readable media for multi-tenant partitioning in a time-series database are disclosed. A partitioning scheme is determined that maps a plurality of data points to a plurality of partitions based at least in part on table identifiers associated with the data points. The partitions are stored using a plurality of storage resources. After the storage resources are provisioned, an additional table identifier is generated. Based at least in part on the partitioning scheme, one or more additional data points comprising the additional table identifier are mapped to a particular partition of the plurality of partitions. The one or more additional data points are stored in the particular partition using the storage resources.

Abstract: Disclosed herein are systems, methods, and processes to perform context-driven (or context-based) data backup and recovery operations. A request to perform a backup operation on a dataset is received. Current external context datasets related to the dataset and generated based on prioritization techniques are collected from computing devices. a saved context dataset is generated based on the current external context datasets. The backup operation is performed by storing a backup image that includes at least a portion of the dataset and the saved context dataset.

Abstract: A method for computer estimations based on statistical tree structures involves obtaining a statistical tree structure for reference elements. The statistical tree structure includes leaf nodes segmenting a statistic for a data label according to data features in the reference elements, and intermediate nodes connecting a first node to the leaf nodes. Each of the first node and the intermediate nodes provide a branching based on one of the data features. The method further includes obtaining target data, including values for the data features, and a value for the data label. The method also includes selecting the first node, associated with a first data feature, traversing the statistical tree structure to a leaf node by matching the values of the data features to the branching of the intermediate nodes, and assessing the value for the data label in the target data based on the statistic associated with the leaf node.

Abstract: A database processing system is disclosed for accessing databases and updated data items and triggering event notifications. The data processing system may comprise a records database including a plurality of data records, and a triggers database including a plurality of trigger indicators. The database system may further include a hardware processor that can execute computer-executable instructions in order to: receive an update on a data record, identify a type of change corresponding to change in the data record, cause an update to the records database based on information included with the updated data record, identify a trigger corresponding to the type of update to the data record, and generate an event notification including information included in the update.

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: A method for constructing blocks to a probabilistic blockchain is provided. The method includes receiving a plurality of transactions from a plurality of agents. Each transaction of the plurality of transactions includes a confidence rating. The method also includes generating a summary based on the plurality of confidence ratings associated with the plurality of transactions. The method further includes generating a block based on the summary and the plurality of transactions. Moreover, the method includes transmitting the block to a plurality of nodes for verification. If the block is verified, the method also includes adding the block to the probabilistic blockchain.

Abstract: The various embodiments described herein include methods, devices, and systems for reading and writing data from a database table. In one aspect, a method of reading and writing data from a database table, includes: (1) initiating a write transaction to write data to a first non-key column of a row of the database table, the database table having a plurality of rows, each row comprising a primary key and a plurality of non-key columns; (2) locking the first non-key column; and (3) in accordance with a determination that the second non-key column is not locked, initiating a read transaction to read data from the second non-key column, where initiation of the read transaction occurs prior to completion of the write transaction.

Abstract: Methods, systems, and computer program products for a customer relationship management (CRM) system are provided herein. Embodiments presented herein provide for exchange of data between disparate, distributed systems; subscribe to and/or publish customer data change event; creation of master records for consumers using static and streaming sources; providing data provenance, auditing capabilities, and queries across multiple tenants and third party systems. Embodiments provide a single view of a customer in a distributed system environment.

Abstract: A method of data replication in a distributed storage system of a mobile communications network is disclosed. The distributed storage system comprises a plurality of geographically separated storage locations. The method comprises, at a first storage location: receiving a first request for data stored in the distributed storage system; determining, based on the first request, further, different, data to be stored at the first storage location; determining a second, different, storage location, of the plurality of storage locations, at which the determined further data is stored; sending, to the determined second storage location, a replication request for replicating the determined further data; receiving, in response to the replication request, the further data; and storing the further data such that the further data is replicated at the first storage location in advance of a further request for the further data being received at the first storage location. Apparatus is also disclosed.

Abstract: A data providing apparatus includes circuitry configured to store a query as a candidate query in a first memory in association with an execution plan and store data in a second memory when receiving the execution plan and the data from a database server in response to transmitting the query to the database server, perform searching the first memory for a first candidate query having content corresponding to content of a first query in response to receiving the first query from a first request source, when the first candidate query is detected by the searching, select a first execution plan associated with the first candidate query by referring to the first memory, extract specific data from the second memory on the basis of the selected first execution plan, and transmit the specific data to the first request source.

Abstract: Taught is a search engine for science tools which dynamically evaluates search rank of said science tools through Natural Language Processing and machine learning. The search engine accepts into a corpus of public and private materials, which references individual science tools. Each item of the corpus is evaluated both as to how much that given item should be trusted, and what that item says about individual science tools. Each science tool is evaluated based on what the whole corpus of input data contains concerning those science tools, taking into account how valuable the source of the data is in order to render an overall score and search rank. The search engine generates a judgement of each individual science tool, which is dynamically updated as new information becomes available in the corpus of input data.

Abstract: In one example, the present disclosure describes a device, computer-readable medium, and method for adaptively clustering media content from multiple different domains in the presence of domain shift. For instance, in one example, a plurality of data content items is acquired from a plurality of different domains, wherein at least some data content items of the plurality of data content items are unlabeled. The plurality of data content items is encoded with a feature representing a domain shift variation that is assumed to be present in the plurality of data content items, wherein the domain shift variation comprises variation in a characteristic of the plurality of data content items. The plurality of data content items is clustered into a predefined number of content categories subsequent to the encoding.