Abstract: A method includes receiving a request to write a data block to a volume resident on a multi-tenant storage array, wherein the request is associated with a first tenant of the multi-tenant storage array, and determining whether the data block matches an existing data block on the multi-tenant storage array, wherein the existing block corresponds to a second tenant. In response to determining that the decrypted data block matches the existing data block: encrypting the existing data block with a shared volume encryption key; encrypting the shared volume encryption key with a first tenant encryption key and providing the shared volume encryption key encrypted with the first tenant encryption key to the first tenant; and encrypting the shared volume encryption key with a second tenant encryption key and providing the shared volume encryption key encrypted with the second tenant encryption key to the second tenant.

Abstract: A batch process operates on structured data in multiple tables, including a first and a second source table, and a first and a second processing table. An additional key is added within each natural key to at least the second source and processing table for identifying a sequence of rows for updating.

Abstract: Embodiments of this specification provide transaction confirmation methods and apparatuses. An example method includes: in response to detecting an event indicating that one of multiple nodes has persistently stored a batch of transactions or executed transactions of a subbatch of transactions, determining a current latest subbatch of subbatches of transactions for which the multiple nodes have confirmed; determining a target subbatch according to the current latest subbatch; determining a first quantity of the multiple nodes that have generated execution results that are consistent with an execution result of the target subbatch; determining a second quantity of the multiple nodes that have persistently stored a target batch to which the target subbatch belongs; and in response to the first quantity and the second quantity both meeting a consensus fault tolerance, determining that transactions in the target subbatch are confirmable transactions.

Abstract: A distributed transaction processing method and system based on a message queue and a database is provided. In the method, a component encapsulation server generates a target compressed package according to the obtained first configuration information of a business request server and the obtained second configuration information of a business execution server, and sends the target compressed package to the business request server and the business execution server, respectively, so that the business request server and the business execution server can decompress and configure the target compressed package to deploy a transaction processing component and a message transmission path. The system includes the component encapsulation server, the business request server and the business execution server. The business request server and the business execution server communicate with each other through the message queue.

Abstract: Data characterizing a result set corresponding to a query of a social media dataset can be received. The query can include a first context including a first context identifier. The result set can include a first entity and a second entity. The first entity can include a first entity identifier and the second entity can include a second entity identifier. A key set can include a first fixed length key characterizing the first entity identifier in the first context. The key set can further include a second fixed length key characterizing the second entity identifier in the first context. The key set including the first fixed length key and the second fixed length key can be deduplicated. A first relevance score associated with the first context can be determined using the deduplicated key set. The first relevance score can be provided.

Abstract: Systems, methods, and computer-readable media for representing data via a multi-structured table are disclosed. The systems and methods may involve maintaining a main table having a first structure and containing a plurality of rows; receiving a first electronic request for establishment of a first sub-table associated with the main table, wherein the electronic request includes column heading definitions and wherein the column heading definitions constitute a second structure; storing the second structure in memory as a default sub-table structure; associating the first sub-table with a first row in the main table; receiving a second electronic request for association of a second sub-table with a second row of the main table; performing a lookup of the default sub-table structure following receipt of the second electronic request; applying the default sub-table structure to the second sub-table.

Abstract: A computer system according to the present invention has a plurality of processor cores that execute a plurality of threads in a parallel manner. When one of the threads updates a database (DB) region that is among a plurality of database regions associated with a database (DB), and that cannot be updated by more than one thread, the computer system selects one of one or more dedicated log buffers as a log buffer to which a log relating to the update of the database region is to be written. In contrast, when one of the threads updates a database region that is among the plurality of database regions, and that can be updated by more than one thread, the computer system selects one of one or more shared log buffers as a log buffer to which a log relating to the update of the database region is to be written. Each dedicated log buffer is a log buffer that can store one or more logs associated with only one thread and that cannot store two or more logs associate with two or more threads.

Abstract: An example operation may include one or more of reading first and second output values of an entity from first and second memory addresses, respectively, storing the first and second output values in a blockchain data structure, executing the blockchain data structure, where the executing comprises selecting one of the first and second output values based on an operation to perform with a third output value, and modifying the selected output value based on the third output value, and storing the modified selected output value at an output memory address.

Abstract: An automated method for evaluating completeness of clinical data being transferred from a clinical device. The clinical data includes continuously logged data, intermittently logged data, and timestamp data associated with each of the continuously logged data and intermittently logged data. The method is executed by a processor and includes receiving the clinical data from the clinical device and based on the timestamp data associated with the continuously logged data, determining a time span over which the continuously logged data was obtained. The timestamp data associated with the intermittently logged data is compared with the determined time span. If any timestamp data associated with the intermittently logged data does not occur within the determined time span, an alert is issued indicating that the continuously logged data of the clinical data is incomplete.

Abstract: The present disclosure provides a solution for migrating data. In the solution, a migration tool first receives, from a source server, an index having index values corresponding to a plurality of files stored at the source server. The migration tool then retrieves a location of an index value corresponding to key information file in the index. The migration tool sorts the index based on the retrieved location. The migration tool processes the plurality of files based the sorted index, such that the sorted index causes the key information file to be processed last.

Abstract: A secure equijoin technique of generating one table from two tables while curbing the volume of communications traffic is provided. The technique includes: a first permutation generating means 110 that generates a permutation <?> from an element sequence which is generated from the first column of a table L and the first column of a table R; a first column generating means 120 that generates, for j=2, . . . , a, by using the permutation <?>, a prefix sum, and an inverse permutation <??1>, the j-th column of a table J from an element sequence which is generated from the to j-th column of the table L; a join-result element sequence generating means 130 that generates a join-result element sequence from an element sequence ([[1]], . . . , [[1]], [[0]], . . . , [[0]], [[?1]], . . . , [[?1]]) by using the permutation <?>, the prefix sum, and the inverse permutation <??1>; a second column generating means 140 that generates, for j=a+1, . . .

Abstract: A method, computer program product, and computer system for storing data in a bucket of a plurality of buckets. A spare bucket may be reserved in the plurality of buckets. A copy of the data may be stored in the spare bucket. A pointer to the data in the bucket and a pointer to the copy of the data in the spare bucket may be updated based upon, at least in part, storing the data in the bucket and storing the copy of the data in the spare bucket.

Abstract: Systems, apparatus, and methods for data distribution within a failure domain tree are described herein. Data objects may be distributed uniformly into symmetric failure domain trees. Asymmetric failure domain trees may be used to generate symmetric failure domain trees. The systems, apparatus, and methods may distribute a data object to attempt to satisfy the failure tolerance level of as many failure domain levels of the symmetric failure domain trees as possible.

Abstract: A method and system for streaming data from portable storage devices. Specifically, the disclosed method and system implement iterative data streaming from a portable storage device for remote storage operations, while requiring zero over-provisioning storage space for buffering incoming write operations to the portable storage device.

Abstract: In a mechanism for deleting blocks from a blockchain, a retention period (T), a minimum number of blocks (L), and a hash of the oldest block are defined. A participant node creates the new block including a block header. The participant node determines whether a timestamp in an oldest block in the blockchain is older than a current time plus T, and whether a current number of blocks in the blockchain is greater than or equal to L. When both are true, the participant node deletes an oldest block in the blockchain. The participant node adds a hash of an oldest remaining block and an original number of blocks of the blockchain to the block header of the new block. The participant node broadcasts a message announcing the new block to remaining participant nodes of the plurality of participant nodes.

Abstract: A first file and a second file are retrieved from a database, in which the first and second files include an unstructured text stream. Metadata of the first and second files are extracted. The extracted metadata include a description category, entity source, geographic region, and a set of sub-files linked to the file. A data structure indicative of relationship between the first and second files is generated. Weighting factor is applied to the generated data structure, which indicates a degree of relationship between the first file and the second file. The relationship and the degree of the relationship are determined based on the extracted metadata of the first and second files. In response to a user requesting the first file, it is determined whether the second file should be provided in conjunction with the first file based on the weighting factor as applied to the data structure.

Abstract: A data structure used in memory-based file system, method and apparatus using thereof. The data structure comprising: a tree of the nodes comprising tree nodes and leaf nodes, each tree node points to at least one node, each leaf node is associated with a plurality of data unit elements each of which representing a data unit, wherein each data unit element is associated with two pointers, wherein at least one of the two pointers is capable of pointing to a data unit or to a data unit element; and a cyclic linked list of data unit elements representing identical clones of a data unit, wherein the cyclic linked list comprises a first element pointing directly to the data unit, wherein from each element in the cyclic linked list, the data unit can be reached in time complexity of O(1).

Abstract: A semiconductor package apparatus may include technology to determine difference information between a parent node of a hierarchical data structure and a child node of the parent node, and store the difference information with the child node of the hierarchical data structure. Other embodiments are disclosed and claimed.

Abstract: Methods, systems, apparatus, including computer programs encoded on computer storage medium, for generating rendering data. The method includes actions of receiving a stream of real-time data, analyzing the stream of real-time data to detect a set of one or more attributes associated with a real-time event, identifying, based on the one or more attributes, one or more data records representing an event-outcome pair, wherein an outcome in the event-outcome pair includes data identifying a content item, obtaining historical data associated with the content item, and generating rendering data including data for rendering a first layer representing real-time data specifying a current value of the content item as an overlay to a second layer representing the obtained historical data associated with the content item, with each of the rendered layers being juxtaposed to one or more specified portions of the graphical user interface.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives, from a requestor, a query for data comprising a condition on a column of a table. The table includes a plurality of records divided into a plurality of zones. The program further determines a set of zones in the plurality of zones that include records that satisfy the condition based on a plurality of tallies associated with the plurality of zones. Each tally in the plurality of tallies is for indicating whether a zone in the plurality of zones include records with data values in the column of the table that satisfy the condition. The program also determines a result set of records in the table that satisfy the condition based on records in the set of zones. The program further sends the result set of records to the requestor.