A method for cluster based searching for a value range stored in a storage system, the method may include receiving a request to find a certain value range within a set of information elements that are stored in a storage system; wherein the set of information elements comprises subsets of information elements associated with subset hash based filters; wherein different subsets of information elements are associated with different subset hash based filters; determining a certain cluster value of a certain cluster that comprises the certain value range; applying one or more hush functions on the certain cluster value to provide one or more hash results; and determining whether one or more members of the certain cluster are possibly in a subset of information elements, based on the one or more hash results and on a subset hash based filter of the subset of information elements; and when determining that the one or more members of the certain cluster are possibly in the subset then searching, within the subset, a matching information element that matches the certain value range.

A record linking platform having a computer system with a processor, multiple databases each having records, such as private health information. Each of the multiple databases are not in direct communication with one another. A control center is in communication with the different entities, the control center configured to: generate a site configuration file, a key configuration file, and a broker configuration file. A keymaster configured to: receive the key configuration file, generate a hash key, and transmit the hash key to the databases. The databases configured to: receive the site configuration file and the hash key; process the records to generate evaluation records data that conform to a data model specified in the site configuration file; and encrypt the evaluation records using the hash key. An honest broker configured to: receive the broker configuration file and the encrypted evaluation records; and link the encrypted evaluation records without decrypting.

A system and method for storing and recovering a computer file. The method includes calculating fingerprint data of the file, separating the file into a plurality of data sub-files each having the same size and a single data sub-file having a smaller size than the other data sub-files, and attaching file metadata to the single data sub-file or as a metadata sub-file. The method also includes padding the single data sub-file including the metadata so that it is the same size as the plurality of data sub-files or the metadata sub-file so that it is the same size as the plurality of data sub-files, adding a header to each data sub-file that includes information about the sub-file, assigning a unique filename to each data sub-file, encrypting each data sub-file, and storing each data sub-file as separate files under their unique filename.

A query directed to database data stored across a set of files is received. The query includes predicates and each file from the set of files is associated with metadata stored in a metadata store that is separate from a storage platform that stores the set of files. One or more files are removed from the set of files whose metadata does not satisfy a predicate of the plurality of predicates to generate a pruned set of files. One or more predicates are removed that are satisfied by the metadata of the pruned set of files to generate a modified query.

A method for enabling pruning of a blockchain of a blockchain network includes creating an active blocks commitments Merkle tree from hashes of active blocks and creating an active smart contracts commitments Merkle tree from hashes of active smart contracts. The Merkle trees are created after an amount of blocks created in the blockchain has reached a threshold set by a pruning threshold parameter stored in the blockchain network. Hashes of the roots of the Merkle trees are stored in a header of a new block as a new genesis block. The new genesis block is broadcast to the blockchain network. A set of the active blocks and active smart contracts used respectively to create the active blocks commitments Merkle tree and the active smart contracts commitments Merkle tree are committed to upon the blockchain network reaching consensus on the new genesis block.

This disclosure relates to improved sketch-based image retrieval (SBIR) techniques. The SBIR techniques utilize a neural network architecture to train a domain migration function and a hashing function. The domain migration function is configured to transform sketches into synthetic images, and the hashing function is configured to generate hash codes from synthetic images and authentic images in a manner that preserves semantic consistency across the sketch and image domains. The hash codes generated from the synthetic images can be used for accurately identifying and retrieving authentic images corresponding to sketch queries, or vice versa.

Time-based partitioning of a data set is applied to capture updates to the data set in a copy of the data set. Items that have been updated in a data set with in a time period are identified. Partitions of the data set that include the updated items are created according to a partitioning scheme. The created partitions are grouped in a storage location for the time period in a file structure that stores a copy of the database. A latest version of the copy of the data set may be accessed according to latest partitions of the data set stored in the different locations of the file structure.

A digital platform enables 3D printing where the designs are protected from piracy/redistribution. A single board computer (SBC) communicates with a first server and a second server. The SBC requests a unique hardware ID from the first server, which assigns and sends the ID to the SBC. The SBC submits the ID and a secret key to the second server to request registration of a user and a printer, and the second server sends private certs, a client ID, and a unique public identifier to the SBC. The second server also receives and stores 3D print designs through a designer portal, and on-demand displays the designs in a GUI screen. The SBC user may purchase a 3D print design, and the second server, in response, sends an access token to the SBC. The SBC redeems the access token for a selected 3D print, and the second server adjusts geode for the selected 3D design for the particular printer, and streams the adjusted geode to the printer through the SBC, thereby protecting the code from unauthorized user/replication.

A regenerated container file is detected, and a file in the regenerated container file is determined that is different from any file in an existing container file related to the regenerated container file. To store the regenerated container file, the different file is sent to the data storage for storing.

An example method is provided in according with one implementation of the present disclosure. The method comprises generating, via a processor, a set of hashes for each of a plurality of objects. The method also comprises computing, via the processor, a high-dimensional sparse vector for each object, where the vector represents the set of hashes for each object. The method further comprises computing, via the processor, a combined high-dimensional sparse vector from the high-dimensional sparse vectors for all objects and computing a hash suppression threshold. The method also comprises determining, via the processor, a group of hashes to be suppressed by using the hash suppression threshold, and suppressing, via the processor, the group of selected hashes when performing an action.