Abstract: Example aspects include techniques for performing vectorized delete operations in a distributed database system including clustering multiple files stored in the distributed database system, and generating, for each of the multiple files and based on a deletion signal, a delta array including multiple bits representing the data items in the file and indicating, based on bit value, the target data items to be deleted from the file. Generating, for each of the multiple files, the delta array can include reading at least one second file shard of multiple second file shards before performing a join operation on at least one first file shard of multiple first file shards is completed.

Abstract: A source table organized into a set of micro-partitions is accessed by a network-based data warehouse. A pruning index is generated based on the source table. The pruning index comprises a set of filters that indicate locations of distinct values in each column of the source table. A query directed at the source table is received at the network-based data warehouse. The query is processed using the pruning index. The processing of the query comprises pruning the set of micro-partitions of the source table to scan for data matching the query, the pruning of the plurality of micro-partitions comprising identifying, using the pruning index, a sub-set of micro-partitions to scan for the data matching the query.

Abstract: Disclosed herein are systems and method for determining data storage insurance policies. In an exemplary implementation, a method comprises receiving a request to add a data storage insurance policy to a plurality of data files. The method comprises extracting data file attributes and determining a data recovery score for each respective data file based on a uniqueness, criticality, and/or importance of the respective data file. The method comprises determining a hardware score for each of a plurality of performance tiers comprising at least one storage server, based on an available capacity, a performance cost, and/or data recovery scores of data files currently stored at each of the plurality of performance tiers. The method comprises selecting and executing a data storage insurance policy for the respective data file based on a plurality of data recovery rules and/or the comparison of the data recovery score and the hardware score.

Abstract: In a first aspect, a method includes, at a node of a Hadoop cluster, the node storing a first portion of data in HDFS data storage, executing a first instance of a data processing engine capable of receiving data from a data source external to the Hadoop cluster, receiving a computer-executable program by the data processing engine, executing at least part of the program by the first instance of the data processing engine, receiving, by the data processing engine, a second portion of data from the external data source, storing the second portion of data other than in HDFS storage, and performing, by the data processing engine, a data processing operation identified by the program using at least the first portion of data and the second portion of data.

Abstract: Embodiments of the present disclosure relate generally to organizing electronic text documents. In particular, one or more embodiments comprise a content management system that improves the organization of electronic text documents by intelligently and accurately categorizing electronic text documents by topic. The content management system organizes electronic text documents based on one or more topics, without the need for a human reviewer to manually classify each electronic text document, and without the need for training a classification algorithm based on a set of manually classified electronic text documents. Further, the content management system identifies and suggests topics for electronic text documents that relate to new or emerging topics.

Abstract: A table organized into a set of batch units is accessed. A set of N-grams are generated for a data value in the source table. The set of N-grams include a first N-gram of a first length and a second N-gram of a second length where the first N-gram corresponds to a prefix of the second N-gram. A set of fingerprints are generated for the data value based on the set of N-grams. The set of fingerprints include a first fingerprint generated based on the first N-gram and a second fingerprint generated based on the second N-gram and the first fingerprint. A pruning index that indexes distinct values in each column of the source table is generated based on the set of fingerprints and stored in a database with an association with the source table.

Abstract: Replication of a filesystem or a mount point or share may replicate all data that it consists of irrespective of where the data is stored. Replication protects data irrespective of location. One method is to replicate the filesystem namespace as is while skipping the data outside of the appliance/machine so that replication cost and time are reasonable. The data outside of the machine, like cloud/tape data is protected differently. One example method includes a data protection operation configured to replication a namespace associated with multiple data tiers. During replication, data from one of the tiers is skipped while all of the namespace metadata is replicated. The recovery restores the namespace metadata and the data that was replicated from the other tier. This may be performed in connection with cyber security, for example when replicating multi-tier data to a vault.

Abstract: Computational systems implement problem solving using hybrid digital/quantum computing approaches. A problem may be represented as a problem graph which is larger and/or has higher connectivity than a working and/or hardware graph of a quantum processor. A quantum processor may be used determine approximate solutions, which solutions are provided as initial states to one or more digital processors which may implement classical post-processing to generate improved solutions. Techniques for solving problems on extended, more-connected, and/or “virtual full yield” variations of the processor's actual working and/or hardware graphs are provided. A method of operation in a computational system comprising a quantum processor includes partitioning a problem graph into sub-problem graphs, and embedding a sub-problem graph onto the working graph of the quantum processor. The quantum processor and a non-quantum processor-based device generate partial samples.

Abstract: In one embodiment, a method includes receiving an indication of a trigger action by a first user at a client system, wherein the trigger action is associated with a priming content object, identifying related content objects associated with the priming content object, selecting recommended content objects based on the priming content object, the related content objects, and profile information of the first user, wherein each of the selected recommended content objects comprises entity information of entities associated with the priming content object, and presenting content suggestions at the client system, wherein each content suggestion comprises one of the selected recommended content objects.

Abstract: A query directed at a source table organized into a set of batch units is received. The query comprises a regular expression search pattern. The regular expression search pattern is converted to a pruning index predicate comprising a set of substring literals extracted from the regular expression search pattern. A set of N-grams is generated based on the set of substring literals extracted from the regular expression search pattern. A pruning index associated with the source table is accessed. The pruning index indexes distinct N-grams in each column of the source table. A subset of batch units to scan for data matching the query are identified based on the pruning index and the set of N-grams. The query is processed by scanning the subset of batch units.

Abstract: Systems and methods are provided for receiving a query created by a user, receiving output data of at least one function to retrieve data related to the query and analyzing the output data of the at least one function to retrieve data related to the query. The systems and methods further provide for generating at least one dynamic knowledge graph associated with the output data of the at least one function, wherein the at least one dynamic knowledge graph comprises data from the output data of the at least one function and indicates relationships between the data, analyzing the at least one dynamic knowledge graph to determine data relevant to the query generated by the user, and generating a response to the query based on the data relevant in the at least one dynamic knowledge graph.

Abstract: Methods and systems for data management of documents in one or more data repositories in a computer network or cloud infrastructure are provided. The method includes sampling the documents in the one or more data repositories and formulating representative subsets of the sampled documents. The method further includes generating sampled data sets of the sampled documents and balancing the sampled data sets for further processing of the sampled documents. The formulation of the representative subsets is performed for identification of some of the representative subsets for initial processing.

Abstract: Methods and systems are disclosed in which audio broadcasts are converted into audio segments, for example, based on segment content. These audio segments are indexed, so as to be searchable, as computer searchable segments, for example, by network search engines and other computerized search tools.

Abstract: A method for recovery of missing or extra data using a bloom filter includes: storing a plurality of transaction messages, each including a transaction value; generating a bloom filter of the transaction messages, the bloom filter being generated using a number of hash rounds and with a size at least double the number of transaction messages; generating a recover message including the number of transaction messages, the number of hash rounds, the size, and the generated bloom filter; transmitting the recover message to a consensus node; receiving a response message from the consensus node, the response message including at least one additional transaction message; and inserting the at least one additional transaction message into the plurality of transaction messages.

Abstract: Computer-readable media, methods, and systems are disclosed for improving performance when dropping database snapshots in an in-memory database by pruning tree branches in one or more converters associated with a snapshot of an in-memory database. A request to compare at least two database snapshots is received. Physical pages associated with at least one of the two database snapshots are loaded. First and second converter streams are iterated. Physical block numbers of intermediate converter pages to which the first and second converter streams currently point are compared. If the physical page numbers are all non-equal, the physical pages referenced by the second converter stream are set to free. If any of the physical page numbers are equal, subsequent traversal of a corresponding converter subtree in the first and second converter streams may be skipped to improve performance.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: The database management system (DBMS) receives a first instruction specifying anonymization rule information corresponding to a column of the relation table, among anonymization rule information that is present for each column included in the relation table and shows a plurality of generalization rules. The DBMS reads the column from the relation table in response to the first instruction, and generates a temporary result obtained by generalizing each attribute value of the column based on any of a plurality of generalization rules. The DBMS generates an aggregate result obtained by aggregating the temporary result. The DBMS generates an anonymization method including generalization information indicating a correspondence relationship of each attribute value of the column and any of the plurality of generalization rules when the aggregate result satisfies a disclosure rule. The DBMS generates anonymization information as a result of processing the relation table based on the first anonymization method.

Abstract: A technique for using a caching layer for key-value storage in a database is described. In one example of the present disclosure, a system can receive, at an unsorted data structure of a caching layer, a key-value pair associated with a data object. The unsorted data structure can store a first plurality of key-value pairs. The system can receive one or more operations for updating the key-value pair in the caching layer. The system can determine the key-value pair is to be migrated to a sorted memory table based on a caching algorithm. The system can migrate the key-value pair to a sorted memory table configured to store a second plurality of key-value pairs that is larger than the first plurality of key-value pairs and sort the key-value pair with the second plurality of key-value pairs prior to storing the key-value pair in the sorted memory table.

Abstract: In one embodiment, a method includes receiving an indication of a trigger action by a first user at a client system, wherein the trigger action is associated with a priming content object, identifying related content objects associated with the priming content object, selecting recommended content objects based on the priming content object, the related content objects, and profile information of the first user, wherein each of the selected recommended content objects comprises entity information of entities associated with the priming content object, and presenting content suggestions at the client system, wherein each content suggestion comprises one of the selected recommended content objects.

Abstract: A method includes: receiving an indication of a new integration flow document that updates a current integration flow document of an integration flow; determining a last switchable node that is included in both the current integration flow document and the new integration flow document; determining, for each running instance of the integration flow using the current integration flow document, whether a currently executing node of the instance is less than or equal to the last switchable node; in response to determining the currently executing node of the instance is less than or equal to the last switchable node, switching the instance to the new integration flow document; and in response to determining the currently executing node of the instance is greater than or the last switchable node, waiting for completion of the instance using the current integration flow document.