Embodiments of the invention provide the ability to track document versioning. Before executing an open operation on a first document version, a first before-hash is generated. After executing the open operation, a first after-hash is generated. Before executing a save operation, the first before-hash is acquired, and after execution (resulting in a second document version), a second after-hash of the second document version is generated. A version hash linked graph (VHLG) is generated and includes document nodes for the different document versions where each node includes a hash of that document version, a user-application node corresponding to the user or application that executed the operations, and edges connecting the nodes (e.g., that identify the operation and/or the document lineage) Based on the VHLG, a full history of a document is provided.

An example operation may include one or more of storing a data block that is included within a sequential chain of data blocks and which comprises a probabilistic data structure stored therein, receiving a request to verify another data block, determining whether a probabilistic hash of the other data block is included within the probabilistic data structure of the stored data block, and in response to a determination that the hash of the other data block is included within the probabilistic data structure, storing an indicator that the other data block is included within the sequential chain of data blocks.

A method for searching an encrypted file comprises: receiving a query from a first device of a set of devices; tokenizing the query; searching the encrypted file, without decrypting the file, for the tokenized query; aggregating results of the search; and outputting the aggregated results. The searching includes checking a bloom filter of an index of the encrypted file. The index includes a file public secret (R), a proof of work for the file secret (Rproof), a multipart threshold public encryption key (LKe-pub), a multipart threshold public search key (LKs-pub), and the bloom filter. The bloom filter including index values that are elliptic curve paired between a curve-hashed token of the encrypted file and the product of the encrypted file's ephemeral secret value (r) and the multipart threshold public search key (LKs-pub).

Systems and methods described herein facilitate the search and presentation of historical data for wireless network usage and provide a mechanism for high-redundancy, low-latency record retrieval of data from large data sets. Network devices divide data for a historical data store into separate record type groups, store metadata for each record type in an application database, partition each record type group by date in a historical record database that is different from the application database, and form, within each date partition, buckets of common hash values of a key parameter from each record. When a user performs a query, the network devices generate a record-specific query form based on the record type metadata to obtain lookup parameters; generate a search hash value using a key parameter from the lookup parameters; and generate a query expression based on the record type, lookup parameters, and the search hash value.

A data search system includes an agent server that includes a storage and stores data in the storage, and a host server that manages tag management information in which a tag as a term for searching the data and a storage as a storage location of the data are associated with the data, receives a query including a search designation tag, and acquires data associated with the search designation tag from the storage location of the data by referring to the tag management information and responds to the query. The host server continuously updates the tag management information according to content and the storage location of the data.

A data backup method includes querying a first block of a first blockchain for unused transaction output information based on a first condition being met, the first block including each block of all blocks included in the first blockchain; generating transaction information according to the unused transaction output information obtained based on the querying, the transaction information indicating a transaction operation based on an account address to which the unused transaction output information belongs; recording the transaction information in a second block and releasing the second block, and recording the second block on which a consensus is reached on a second blockchain; and backing up the first blockchain into a storage system, and deleting the first blockchain. Counterpart apparatus, terminal, server, and/or non-transitory computer-readable medium are also contemplated.

Systems and methods are provided for determining multiple fragments of data to be imported, the multiple fragments of data corresponding to different instances of data obtained from one or more external data sources, the different instances of data each corresponding to duplicate content. The multiple fragments of data that each correspond to different instances of duplicate content can be ingested. The multiple fragments of data can be de-duplicated to determine one or more corresponding object data source records (DSRs). The one or more object DSRs can be imported within a data platform system.

In some embodiments, a system for synchronizing content with client devices receives a request from a client device to synchronize operations pertaining to content items associated with a user account registered at the system. The request can include the operations and a cursor identifying a current position of the client in a journal of revisions on the system. Based on the operations, the system generates linearized operations associated with the content items. The linearized operations can include a respective operation derived for each of the content items from one or more of the operations. The system converts each respective operation in the linearized operations to a respective revision for the journal of revisions and, based on the cursor, determines whether the respective revision conflicts with revisions in the journal. When the respective revision does not conflict with revisions in the journal, the system adds the respective revision to the journal.

The disclosed embodiments include systems and methods for tracing data. A disclosed tracing system can receive a request to access original data. The request can be associated with access request metadata. The tracing system can generate a tracer based at least in part on the access request metadata and can generate an altered version of the first data by inserting the tracer into the orginal data. The tracing system can update a database or log file associated with the first data to include association information based on the access request metadata. The tracing system can then provide the altered version of the first data in response to the request.

Embodiments of method and system are directed to a best effort method to reconstruct the corrupt files from available nodes or tiers and heal or repair the corrupt files. The method looks for the existence of fingerprints of the lost segments in available tiers on the nodes or across nodes within a cluster. The method discovers the copies of these missing segments, creates an Lp tree referring these discovered segments and creates a virtual file in the namespace. The file is then moved to the destination tier where the corruption exists, thus healing the corruption.