Abstract: A method, computer-readable medium, and apparatus for configuring a software defined network via machine learning are disclosed. For example, a method may generate a first policy for a first service by a first policy model using machine learning for processing first data of the first service, the first service being implement by at least one first virtual component of a software defined network, determine whether the first policy is to be applied to a second service, the second service being implement by at least one second virtual component of the software defined network, apply the first policy to the second service when the first policy is deemed to be applicable to the second service, generate a second policy for the second service, and implement the second policy in the second service, wherein the first service and the second service are provided by a single service provider.

Abstract: A method, computer program product, and computer system for optimizing query processing is provided. An asynchronously updated index is provided for a main dataset. A time-sequences log of data modifications to the main dataset is provided. A query of the main dataset is received. The main dataset is joined with the time-sequenced log data resulting in a first intermediate result. The query is processed by keeping one or more entries satisfying the query by emulating a function of the asynchronously updated index resulting in a second intermediate result. Updated, deleted dataset entries are deleted from the asynchronously updated index. The query is processed resulting in a third intermediate result. A union of the second intermediate result and third intermediate result is built defining a final result.

Abstract: A computer system provides at least one workspace as a user interface corresponding to a user-generated topic. A home topic is provided to the user as an initially selected topic. The home topic provides a workspace to the user as a user interface. User selection of a first topic within the home topic causes designation of the first topic as the current topic. A first workspace is associated with the first topic, and a first topic data structure associated with the first topic is generated and the first topic data structure is associated only with application windows, files and application related data used by the user while the first topic is designated as the current topic. The user is provided, within the first workspace, only application windows, files and application related data used by the user while the first topic is designated as the current topic.

Abstract: Various embodiments include a system for grouping a set of distinct records in a database system, the database system comprising a first database cluster H and a second database cluster L. In many embodiments, the system can comprise one or more processing modules and one or more non-transitory memory storage modules storing computing instructions configured to run on the one or more processing modules. In some embodiments, the computer instructions can be configured to perform acts of determining, for each distinct record (i) of the set of distinct records, whether the record is a first priority or a second priority; for each distinct record (i) of the set of distinct records which is determined to be the first priority, storing the record in the first database cluster H, wherein the first database cluster H comprises a first computer server; and for each record (i) of the set of distinct records which is determined to be the second priority, storing the record in the second database cluster L.

Abstract: Disclosed are systems, methods and computer program products for data deduplication during a backup using at least two LSM trees. An example method includes calculating, for a first data block, a first hash value associated with the first data block and determining a reduced hash value based on the first hash value. The method includes determining whether the first data block contains data duplicative of an existing data block in a prior backup based on whether the reduced hash value occurs in a first log-structured merge (LSM) tree. If so, the method includes comparing the first hash value to one or more hash values in a second LSM tree to identify a matching hash value, and writing a first segment identifier (ID) corresponding to the matching hash value in an archive, the first segment ID referencing the existing data block in a segment store.

Abstract: A gateway for X2 interface communication is provided, including: an X2 internal interface for communicating with, and coupled to, a plurality of radio access networks (RANs); and an X2 external interface for communicating with, and coupled to, a destination outside of the plurality of RANs, the X2 external interface further including a single X2 endpoint for the plurality of radio access networks, such that the X2 external interface provides a single interface for an external macro cell or core network to interact with the plurality of radio access networks. The gateway may further include a handover module for maintaining X2 signaling associations and transactions for incoming and outbound handovers, including X2 to S1 and S1 to X2 translation.

Abstract: A computer-implemented method for creating a visualization of beacons collected over a specified time period from users on a website. Beacons are rendered as nodes grouped into clusters, with relatedness between beacons being represented as a link. The number of nodes rendered is reduced along with the number of links that connect pairs of nodes. The resulting data structure is rendered as a force-directed chart by assigning force unit values to each of the nodes and links, each representative node of a cluster of nodes being assigned a relatively high negative charge and all remaining nodes in the cluster being assigned a relatively low negative charge. Link distances and strengths between unrelated/related clusters are also assigned values. A set of physical laws is applied to all of the nodes and links to determine their relative position in the visualization based on their assigned force unit values.

Abstract: A computing system can register a measurement tool. The computing system can determine a selected vehicle for a vehicle data report and a selected measurement tool to perform a first tool measurement that excludes determining data from a vehicle data message. The computing system can determine a selected vehicle component for the first tool measurement by the selected measurement tool. The computing system can determine a spatial identifier for the first tool measurement. The computing system can determine the first tool measurement performed by the selected measurement tool. A radio transceiver of the computing system can receive radio signals carrying the first tool measurement from the selected measurement tool. The first tool measurement received by the radio transceiver can be provided to one or more processors of the computing system. The computing system can generate and output the vehicle data report that includes the first tool measurement.

Abstract: A system may be configured to implement two or more different types of data stores for data storage. For example, the system may include a small object data store and a large object data store. The system may compare the size of a data file to a predetermined threshold size. If the data file is smaller than the predetermined threshold size, the system may write the data to the small object data store. If the data is larger than the predetermined threshold size, the system may write an intent message to the small object data store referencing the data in the large object data store, and may write the data to the large object data store. The system may update the intent message in the small object data store to indicate that the data was successfully written.

Abstract: The present document describes a method (800) for allocating bits to a frame (301) of a sequence of frames (301) to yield a bitstream having a constant average bitrate, wherein the frame (301) comprises audio data and metadata. The method (800) comprises maintaining (801) an overall bit reservoir (100) and maintaining (802) a virtual bit reservoir (510) being a subset of the overall bit reservoir (100), such that bits for the metadata of the frame (301) are allocated from the virtual bit reservoir (510) and such that bits for the audio data of the frame (301) are allocated from the overall bit reservoir (100).

Abstract: Techniques for providing feed-based case management on an online social network. A user interface that includes a publisher and an information feed is provided. Information associated with a record is received and the record is updated in a database system. A feed item associated with the database system update is generated and provided in the information feed. The feed item includes one or more actionable selections providing a reference to the publisher. Selection of one of the one or more actionable selections causes the publisher to be operable to receive further information associated with the record. The record is capable of being updated based on the further information. In some implementations, the record is a case and the user interface serves as a single interface for all interactions required in solving the case.

Abstract: Methods, systems, and computer program products for applying entity search techniques to expedite entitlement resolution in support services are provided herein. A computer-implemented method includes automatically processing multiple distributed data sources to identify data sources to be used in entitlement queries, identify data elements within each of the data sources, and implement search-enhancing features across the data sources; automatically searching the collection, in response to an entitlement query failure due to incorrect and/or missing data object values in a set of data object values input for the entitlement query, to identify alternate sets of values; applying a scoring algorithm to each of the alternate sets of values to generate a score that quantifies an amount of matching between each of the alternate sets and the set of data object values input in connection with the entitlement query; and outputting the alternate sets of values having the highest scores.

Abstract: A system for modifying a website or interactive application, including a published database accessible via an end user data service to present the most up to date version of objects of the website, viewable and editable by at least one user, a draft database accessible via a designer data service and viewable and editable by at least one designer to store edits to the objects of the published database; a published database request handler to coordinate concurrent viewing and updating of the objects between the end user data service and the published database and a draft database request handler to coordinate concurrent viewing, editing and updating of the objects between the designer data service and the draft database and to merge edits and updates to the objects in both the published database and the draft database and to return the merged version of the objects without modifying the published database.

Abstract: A map update system, a navigation device, and a server device is provided. The map update system updates map data of the navigation device based on map data stored by the server device, the map data includes section data corresponding to each section of a navigation map divided into multiple sections and management data designating the section data to be referenced when rendering, the server device receives generation information from the navigation device of map data being currently referenced by the navigation device and creates difference data between map data of a generation corresponding to the received generation information and map data of a newest generation, the navigation device creates updated management data and updated section data by updating management data and section data corresponding to the difference data and writes respectively updated data on different areas that are different from areas on which respective pre-update data area stored.

Abstract: A system and method include receiving a request to transfer data from a first storage space to a second storage space. The system and method also include creating an access table and a location table. The access table includes one or more access values indicative of data being accessed. The location table includes one or more location values indicative of a location of the data in the first storage space or the second storage space. The system and method also include transferring data between the first storage space and the second storage space using the access table and the location table. The data is accessible on both the first storage device the second storage device based on the one or more location values of the location table and access to the data is based on the one or more access values of the access table.

Abstract: A first set of original records is processed by a first processing entity to generate a second set of records that includes the original records and one or more copies of each original record, each original record including one or more fields. The processing of each of at least some of the original records includes: generating at least one copy of the original record, and associating a first segment value with the original record and associating a second segment value with the copy. The method also includes partitioning the second set of records among a plurality of recipient processing entities based on the segment values associated with the records in the second set, and, at each recipient processing entity, performing an operation based on one or more data values of the records received at the recipient processing entity to generate results.

Abstract: A system includes a transmitting agent configured to select a transport mechanism for transmitting a data item, and a receiving agent configured to select one or more data repositories and a storage process for storing the data item. One storage process includes storing the data item temporarily in the second data repository, and subsequently transferring the data item from the second data repository into the first data repository. Another storage process includes storing the data item into a first data repository without temporarily storing the data item in the second data repository.

Abstract: A record management system stores records for an organization having a plurality of members and a plurality of groups, and manages accessibility of the records for the organization according to a specified record access policy. The record management system generates an accessibility database that indicates, for each member, records that are explicitly or implicitly accessible by each member such that the records accessible for each member can be quickly determined if needed. A member has explicit access to a record if there is an explicit indication of accessibility between the member and the record. A member has implicit access to a record through membership associations to other members or groups that have access to the record. The record management system also receives search queries from members and returns records that are relevant and accessible to the members based on the accessibility database.

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into systems each having multiple nodes. A search index is provided in each system for locating objects within the system. A method of managing the search index comprises splitting the search index into shards to be divided among a plurality of regions (704). The regions are larger in number than the nodes in the system. Each region has a master and at least one backup copy of one of the shards. A shard core is a master or backup copy of a shard. The method further comprises distributing the shard cores to the nodes, and providing a region mapping table in each node in the system to map the shard cores to the nodes in which the shard cores are stored (706).

Abstract: Methods, systems, and devices for user clustering on a cloud platform are described. A user associated with a client may implement a search function to query objects in a database system, and may select an entity (i.e., the clicked entity) from the search results. Each client may utilize the cloud platform in a specific manner, where users associated with the client may frequently search for certain types of objects. In some cases, one or more clients may share similar search histories or clicked entities. A clustering server may group clients with similar search histories or click distributions into common clusters. For future searches, the clustering server may utilize a machine learning model to predict the type of object being searched for based on the clustering. For example, user devices associated with a particular cluster may display similar groups and orders of object types in response to similar queries.

Abstract: The present technology displays an access list, seen state information, and presence information for content items stored and managed by a content management system. Advantageously, the present technology does not require users to view or work on content items within the content management system—they can work on content items natively on their own computing device.

Abstract: Described are techniques for processing an instance of a data structure. A request to process an instance of a data structure at a first point in time is received. At least one of the data elements in the data structure is a dynamic data element that uses an association specifying how to access data for the dynamic data element in accordance with criteria evaluated using a current context determined at a point in time. In response to receiving the request, first processing is performed including determining whether the dynamic data element is referenced at the first point in time, and, if so, evaluating the criteria using a current context determined at the first point in time, and retrieving data for the dynamic data element in accordance with a current context determined at the first point in time.

Abstract: A method and system are provided. The method includes providing an actionable business entity operating model. The method further includes extending the actionable business entity operating model to drive user interface behavior on a user interface device having at least a display device, by extending class and property meta classes of the actionable business entity operating model to include user interface behavior semantics. The extending step includes configuring the user interface behavior semantics to be responsive to an operation state of the actionable business entity operating model.

Abstract: Methods and systems for automatically detecting and responding to phishing campaigns are described herein. Real-time feeds may be streamed from one or more social media servers. Each online post from the real-time feeds may be analyzed to determine whether the online post corresponds to a phishing campaign, by examining any web content that is linked from the online post. When it is determined that the online post corresponds to a phishing campaign, target user accounts of the phishing campaign may be identified by analyzing which user accounts have accessed the web content linked from the online post. Restrictions may be imposed to the target user accounts to prevent an account take-over and other losses to the user accounts.

Abstract: A data storage system implements aggregation, bifurcation, and/or reduction techniques to improve the efficiency of processing data storage requests. Data storage requests and/or their associated payloads may be aggregated based on one or more parameters. Data to be the stored and the associated commands may be separated so as to optimize a system's throughput and latency for each. Furthermore, extraneous commands and requests may be reduced or eliminated based on heuristics associated with the requests and the data.

Abstract: A method and system for storage of an aggregation file and method and system for compression of the same. The method for compressing an aggregation file includes: acquiring the aggregation file to be compressed; copying remaining files in the acquired aggregation file into a new aggregation file based on metadata of a deleted object stored in a deletion file corresponding to the acquired aggregation file; and removing the acquired aggregation file. The present invention also provides a system for compressing an aggregation file and a method and system for storing an aggregation file.

Abstract: When a client device loads a resource, a request for a first content item for a first content item slot is transmitted to a content item selection system. The content item selection system uses a predictive model to determine a predicted content item slot based on a document object model position of the first content item slot and a URL of the resource or a publisher identifier. Parameters for the predicted content item slot are used to select a subsequent content item for the predicted content item slot. The first content item and the subsequent content item are transmitted to the client device responsive to the request. The subsequent content item includes metadata indicative of the parameters of the predicted content item slot to be matched to a subsequent content item slot of the resource.

Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN). The method begins by receiving a data access requests with regards to a data object. The method continues by identifying a vault set based on the data access request, where a plurality of storage vaults includes the vault set. The method continues by obtaining configuration information associated with the vault set and determining whether to process the data access request based on the obtained configuration information associated with the vault set.

Abstract: Systems for high-performance, low-latency database log mining applications. A method commences upon receiving a log mining query. The query specifies desired results that correspond to a prior logical state of the database system. A first type of processing entity is invoked to process contents of the redo stream by loading metadata into a data dictionary, and a second type of processing entity is invoked to construct metadata from the redo stream, wherein the constructed metadata pertains only database objects referenced in the query. During the time that the first type of processing entity is processing contents of the redo stream by loading metadata into a data dictionary, a process of a second type serves incoming queries using a subset of entries in the redo stream. When the data dictionary is completed, a switchover point is reached and thenceforth, incoming queries are served using the first type of processing entity.

Abstract: An interactive system configured to interact with users in response to user inputs provided to the system, where the users are instructed to provide the inputs by causing communications in an existing network with the user inputs embedded in the communications, a computing device coupled with the network is configured to monitor communications in the network to identify the user input in the communications, and transmit data representing the user input to the interactive system. The operations and communications in the existing network are performed with the interactive system; and the communications containing the user inputs are identified via the computing device for addition use in the interactive system.

Abstract: A method is disclosed including instrumenting a first version of an application on a plurality of end user devices and receiving execution data for the first version of the application from at least some of the plurality of end user devices. The execution data may be generated by the instrumentation in response to an execution of the first version of the application by the at least some of the end user devices. The method further includes automatically generating execution scripts based on the received execution data. The execution scripts may be configured to reproduce the execution of the first version of the application by the at least some of the end users devices. The method further includes automatically executing at least one of the execution scripts on an updated version of the application.

Abstract: A system includes a first and a second storage device and a computing device. A set of partitions includes a first subset of partitions and a second subset of partitions. The first storage device stores the first subset of partitions. The second storage device stores the second subset of partitions. The computing device is configured to execute an iterative update of a selected partition until a fully updated partition is generated. The updated partition generated in a current iteration is used as a selected partition in the next iteration, and a not yet updated partition is updated in every next following iteration.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributing content items. In one aspect, a method includes receiving user interaction data specifying user interactions with a publisher resource. A heat map specifying levels of user interaction with various portions of the publisher resource is created. Content item slot performance information specifying one or more performance measures for content items presented in various candidate content item slot locations are identified. One of the candidate content item slot locations is selected based on the heat map and the one or more performance measures. Data that cause presentation of suggestion information that identify the one candidate content item slot location as a suggested content item slot location are generated and output.

Abstract: Embodiments of the present invention disclose interactive methods, interactive apparatus, and user equipment. An interactive method disclosed herein comprises: acquiring a piece of user input information, wherein the piece of user input information comprises at least two pieces of biometric feature information and at least one piece of input action information corresponding to the at least two pieces of biometric feature information; determining at least two pieces of content respectively corresponding to the at least two pieces of biometric feature information; determining inter-content operation information corresponding to the at least one piece of input action information; and performing an interactive operation corresponding to the inter-content operation information, wherein the interactive operation is associated with the at least two pieces of content.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit operates to receive a write threshold number of slices of a data object and an access policy; determine a current timestamp that indicates a current time value; and store the write threshold number of slices, the access policy, and the timestamp in a plurality of storage units of a dispersed storage network (DSN).

Abstract: The technology disclosed relates to embedding private comments in public messages. In particular, it relates to customizing public messages by including private comments that are directed to specific recipients. The private comments are included in the context of the public messages sent to their intended recipients but excluded from the public message when it is sent to other recipients. The private comments can be viewable only to their intended recipients and in the context of the public response. The public response as seen by recipients not intended to receive private comments does not include the private comments. This enables a sender of a private comment to efficiently communicate selected information to specific recipients without burdening all recipients with information which may not be relevant for them. Furthermore, it preserves the overall context of the original message.

Abstract: Data in a database cache in memory of an operating database server is copied to memory of a standby database server, without requiring synchronization between the operating server and the standby server. If the operating server fails, the database is recovered to a consistent state in the standby server using a sequential database log and the copied data in the cache of the standby server. Preferably, recovery is performed by reading the log to determine a set of database actions to recover, verifying blocks of data in the standby server's cache, using verified blocks to recover at least some actions, and reading blocks from storage only when a corresponding verified block is not available in the cache.

Abstract: Method of implementing generational garbage collection for trees under MVCC starts by detecting live objects in trees. Trees include normal trees and frozen trees. Poorly-filled young chunks and poorly-filled old chunks of hard-drive memory are identified. Hard-drive memory includes young chunks storing young elements, old chunks storing old elements, and immortal chunks storing immortal elements. One or more old chunks are opened for writes and elements from poorly-filled young chunks and old chunks are copied to one or more opened old chunks. Elements above elements from poorly-filled young chunks and old chunks in the normal trees are updated and stored in the young chunks. One or more immortal chunks are opened for writes and tree leaves of frozen trees from young chunks and from old chunks are copied to one or more opened immortal chunks. All nodes of frozen trees are updated and stored in immortal chunks.

Abstract: Techniques for selecting one of a plurality of heterogeneous memory units for placement of blocks of data (e.g., memory pages), based on both reliability and performance, are disclosed. A “cost” for each data block/memory unit combination is determined, based on the frequency of access of the data block, the latency of the memory unit, and, optionally, an architectural vulnerability factor (which represents the level of exposure of a particular memory data value to memory faults such as bit flips). A memory unit is selected for the data block for which the determined cost is the lowest, out of all memory units considered, and the data block is placed into that memory unit.

Abstract: Systems, methods, apparatuses, and software for data storage systems are provided herein. In one example, a data storage system is provided that includes processing systems configured to receive storage operations for storage drives coupled over a communication fabric. The data storage system includes a control processor configured to establish a timer synchronization signal and distribute the timer synchronization signal to the processing systems. Each of the processing systems is configured to assign timestamps to received storage operations based on a timestamp counter synchronized among the processing systems using the timer synchronization signal. The processing systems are configured to order committing of the storage operations to the storage drives based at least on the timestamps associated with the storage operations.

Abstract: Disclosed are various embodiments for assigning user interface widgets to page slots associated with a page template. In response to a request to generate a content page, content placement requests are then received from user interface widgets. The page slots are associated with a placement value indicating a value of the page slot relative to other page slots in the page template. The highest ranked user interface widgets according to an effectiveness metric or placement score are scheduled for placement in the content page.

Abstract: The present disclosure describes a system and method that identifies locations in source code files that are associated with particular Web requests. The system generates a fingerprint for each Web request based at least in part on the parameters of each HTTP request. By fingerprinting the properties of the source code that generates each HTTP request, Web requests that are generated by executing the fingerprinted code can be traced back to specific source code files, and in some cases an exact line of code. In many examples, a webpage or an action on a webpage can be traced back to a line of source code that is associated with the request. This may allow a developer to find a software defect or security vulnerability by tracing Web requests of a running application and then mapping suspect Web requests back to corresponding lines of code.

Abstract: A method including: receiving at a server a first request from a first provider to retrieve a first configuration for a first lookup order; determining the first configuration for the first lookup order using the server based at least in part on both an ordering specified by the first lookup order and the first call being through the direct dependency relationship; providing the first configuration to the first provider; receiving at the server a second request from the first provider to retrieve a second configuration for a second lookup order; determining the second configuration for the second lookup order using the server based at least in part on both an ordering specified by the second lookup order and the second call to the first provider by the application being through the transitive dependency relationship; and providing the second configuration to the first provider. Other embodiments are described.

Abstract: A method for de-duplicating updates in virtual machines (VMs) is provided that may be executed on a host computer u a hypervisor. Client VMs are derived from a base image, and the method includes: creating a temporary virtual machine, updating the temporary virtual machine, identifying modified blocks of the updated temporary virtual machine, and identifying files associated with the modified blocks. Moreover, the method includes determining block identifiers of matching files of a VM corresponding to identified files of the updated temporary VM, moving block content of blocks relating to the determined block identifiers from its initial location to a free location within the client VM if the block content and the matching files are not identical in the client virtual machine and the temporary VM, and de-duplicating content within the client VM, generating a complete bootable image, and replacing the base image by the temporary VM.

Abstract: In one example, the present disclosure describes a device, computer-readable medium, and method for discovering and tracking uniform resource locators (URLs) for the purposes of managing sponsored data. For instance, in one example, a method includes monitoring a request for a stream of data delivered to a user endpoint device via a content distribution network, wherein the stream of data is accessed via a digital content distribution application running on the user endpoint device, discovering a uniform resource locator associated with the stream of data, and updating a list of sponsored uniform resource locators in accordance with the discovering, wherein the sponsored uniform resource locators comprise uniform resource locators that are permitted to be accessed by the digital content distribution application without impacting a data allowance allocated to the user endpoint device.

Abstract: An approach is provided for managing a reorganization of a database object. Because a reorganization utility cannot acquire exclusive access to the object to complete the reorganization, determinations are made: an amount of transaction log records corresponding to active units of work using the database object is determined to be less than a first threshold; a sum of costs of SQL statements executed in the units of work is determined to be less than a second threshold; and a priority of the reorganization is determined to indicate a greatest priority among multiple priorities. Based on the determinations, (1) a reorganization lock providing exclusive access to the database object is acquired, (2) process(es) holding lock(s) on the database object experience a lockout error, a rollback of the process(es) is issued, and the lock(s) are released, and (3) the utility completes the reorganization based on the lock(s) being released.

Abstract: A CCN network node use reputation values for one or more interfaces to determine how to forward an Interest. During operation, the network node can receive an Interest or Content Object via a network interface, determines one or more candidate outbound faces for forwarding the Interest by performing a longest-prefix-matching lookup in a forwarding information base (FIB) using the Interest's name or name prefix as input. A respective FIB entry maps a name prefix to a forwarding rule that includes a corresponding outbound face for the name prefix. The node can determine a reputation value for each of the candidate outbound faces based on reputation information stored in association with the Interest's name or name prefix, and selects a candidate outbound face with a reputation value exceeding a first predetermined threshold. The node can then forward the received Interest via the selected outbound face.

Abstract: A data storage system protects data identified for deletion which has been created or modified between scheduled data backups. For instance, the system monitors data operations and when the data operation is a delete, the system determines whether the data identified for deletion has been protected by a backup operation. Data that has not been backed up, such as newly created data, is copied to temporary storage before deletion. When the data has been protected, the system determines whether the data has been modified after the backup operation. Data modified after the backup operation is copied to temporary storage before deletion.

Abstract: Techniques are disclosed for accessing on-premise and off-premise datastores organized using different application schemas. An interface serves requests, from a tenant, by accessing either the on-premise datastore or the off-premise datastore. The interface receives a request for a particular data set. Based on the request itself, the interface selects either the on-premise datastore or the off-premise datastore to retrieve the particular data set. The interface retrieves the particular data set from the selected datastore without attempting to retrieve the particular data set from the non-selected datastore. The interface transmits and/or presents the particular data set.

Abstract: A file and a sequence of snapshots of the file are stored in a storage device. The sequence of snapshots includes sequentially captured copies of earlier states of the file. A dependency tree indicating data blocks that are different between a given snapshot and a previous snapshot in the sequence of snapshots is stored in the storage device. The sequence of snapshots is sequentially scrubbed, beginning with an earliest snapshot in the sequence of snapshots. When scrubbing a snapshot, each of the data blocks identified in the dependency tree as being different than the data blocks of a previous snapshot in the sequence of snapshots are scrubbed. If a corrupted data block is detected, a determination of which later snapshots include the corrupt data block is made based on the dependency tree and the corrupted data blocks are corrected.