Presented herein are methods of replicating versioned and hierarchical data structures, as well as data structures representing complex transactions. Due to interdependencies between data entities and a lack of guaranteed message ordering, simple replication methods employed for simple data types cannot be used. Operations on data structures exhibit dependencies between the messages making up the operations. This strategy can be extended to various types of complex transactions by considering certain messages to depend on other messages or on the existence of other entries at the data store. Regardless of origin, these dependencies can be enforced by suspending the processing of messages with unsatisfied dependencies until all of its dependencies have been met. Alternately, transactions can be committed immediately, creating entities that include versioned identifiers for each of their dependencies. These entities can then be garbage collected of the parent objects are not subsequently created.

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 set of data units associated with a data object is obtained, such that respective instances of the data object can be reconstructed from respective subsets of the set. Corresponding to a request for the data object, a first subset of the set is identified. The first subset meets a uniqueness criterion with respect to other subsets of the set that are used to respond to other requests for the data object. An instance of the data object is reconstructed from the first subset.

Embodiments of the disclosure provide systems and methods for identifying hierarchically related files stored in a database. According to one embodiment, this can be accomplished using a pipeline of worker applications which each use a specific table stored in the database 35 and a sequence or series of queues. Generally speaking, each worker application can read a message identifying tasks to be performed from one queue in the sequence of queues, perform those tasks using the appropriate table from the database to identify a set of files, and write one or more messages to a subsequent queue in the sequence or series of queues to pass results and/or further tasks to be performed to a subsequent worker application in the pipeline of worker applications.

Datasets are available from different dataset servers and often lack well-defined metadata. Thus, comparing datasets is difficult. Additionally, there might be different versions of the same dataset which makes the search even more difficult. Using systems and methods described herein, quality scores, dataset versioning, topic identification, and semantic relatedness metadata is stored about datasets stored on dataset servers. A user interface is provided to allow a user to search for datasets by specifying search criteria (e.g., a topic and a minimum quality score) and to be informed of responsive datasets. The user interface may further inform the user of the quality scores of the responsive datasets, the versions of the responsive datasets, or other metadata. From the search results, the user may select and download one or more of the responsive datasets.

A method for database syncing is provided. The method includes receiving database change indicators indicating changes to a database. For each database change indicator, the method also includes determining whether the respective change to the database corresponds to a single change to a single version of the database, one of multiple changes to a common version of the database, or one of multiple changes to different versions of the database. The method further includes generating a change log compaction data structure comprising entries. Each entry includes an exact entry defining a corresponding single change to a corresponding single version of the database, a range entry defining corresponding multiple changes to a corresponding common version of the database, or an interval entry defining corresponding multiple changes to corresponding different versions of the database.

Transient product master data may be used to represent temporarily used objects and resources. Instead of generating complete master data upfront, a placeholder is used in a tracking document for the temporary use. A tracking document for the temporary use includes a placeholder reference. When the product to be used temporarily is selected and ready to be physically moved, attributes and other information of the product may be sent to a management system via an interface. This information may be used to automatically generate transient material master data that is accessible using a reference. This reference may be used to update the placeholder reference in the tracking document and it may be used in further tracking documents.

Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Some examples relate generally to computer architecture software for data classification and information security and, in some more particular aspects, to verifying audit events in a file system.

Systems and methods for virtual image testing. An example method may comprise receiving, by a messaging application, an identifier of a file residing a file system. Configuring a file serving process to respond to content requests specifying the file. Transmitting, by the messaging application, a notification comprising a uniform resource locator derived from the file identifier.