Transmitting filesystem changes over a network

US9235593B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9235593-B2
Application numberUS-89582710-A
CountryUS
Kind codeB2
Filing dateSep 30, 2010
Priority dateSep 30, 2010
Publication dateJan 12, 2016
Grant dateJan 12, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Transmitting filesystem changes over a network is disclosed. A hash of data comprising a chunk of directory elements comprising one or more consecutive directory elements in a set of elements sorted in a canonical order is computed at a client system. One or more directory elements comprising the chunk are sent to a remote server in the event it is determined based at least in part on the computed hash that corresponding directory elements as stored on the remote server are not identical to the directory elements comprising the chunk as stored on the client system.

First claim

Opening claim text (preview).

What is claimed is: 1. A method of synchronizing filesystem changes, comprising: sorting, in a canonical order, a list of directory elements wherein each directory element includes a canonical representation of metadata associated with a node in the filesystem; determining a chunk of directory elements comprising one or more consecutive directory elements by breaking up the sorted list of directory elements sorted in a canonical order; computing at a client system a hash of data comprising the chunk of directory elements sorted in canonical order; determining based at least in part on the computed hash whether the corresponding directory elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system, wherein the determining whether the corresponding directory elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system comprises determining whether the computed hash is previously stored in a hash cache on the client system; and in the event that the computed cache was not previously stored in the hash cache, sending, to the remote server, the computed hash and information from which the remote server computes a verification hash, wherein the computed hash is compared to the verification hash to determine whether the corresponding directly elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system; and sending the one or more directory elements comprising the chunk to a remote server in the event it is determined based at least in part on the computed hash that corresponding directory elements as stored on the remote server are not identical to the directory elements comprising the chunk as stored on the client system, wherein at least a portion of the one or more directory elements comprising the chunk that are sent to the remote server correspond to at least a subset of changes in data stored at the client system since a previous synchronization between the remote server and the client system. 2. The method of claim 1 , further comprising receiving from the remote server an indication whether a corresponding hash corresponding to the computed hash and computed by the server based on corresponding filesystem information stored on the server matched the computed hash. 3. The method of claim 2 , further comprising adding the computed hash to the hash cache if the response from the server indicates that the corresponding hash matched the computed hash. 4. The method of claim 3 , further comprising adding the computed hash to the hash cache once the one or more directory elements comprising the chunk have been sent to the remote server in response to receiving from the server an indication that the corresponding hash computed at the server did not match the computed hash sent by the client system. 5. The method of claim 1 , further comprising adding the computed hash to a span of consecutive chunks, if any, the respective hashes of which have been found in the hash cache, in the event the computed hash is found in the hash cache. 6. The method of claim 5 , further comprising synchronizing the span and the chunk if the computed hash is not found in the hash cache. 7. The method of claim 6 , wherein synchronizing the span includes sending to the remote server a hash of directory elements comprising chunks included in the span. 8. The method of claim 7 , further comprising sending directory elements comprising chunks included in the span to the remote server in the event an indication is received that a corresponding hash computed based on directory elements stored on the server that correspond to elements comprising the chunks included in the span as stored on the client system did not match the hash of directory elements comprising chunks included in the span sent by the client system. 9. The method of claim 5 , further comprising: determining upon reaching an end of the set of elements that the span covers the entire set of elements; and ensuring that a hash of the entire set of elements is stored in the hash cache. 10. The method of claim 9 , further comprising checking at the outset of a synchronization of the set of elements whether said hash of the entire set of elements is stored in the hash cache; and concluding without further processing that the set of elements are in sync between the client system and the remote server if the hash of the entire set of elements is found in the hash cache. 11. The method of claim 9 , further comprising synchronizing the span if upon reaching the end of the set of elements it is determined that the span does not cover the entire set of elements. 12. The method of claim 1 , wherein each of the directory elements comprises a canonical representation of metadata comprising filesystem information associated with a corresponding file in a directory with which the directory elements are associated. 13. The method of claim 12 , further comprising generating the respective canonical representations. 14. The method of claim 13 , further comprising sorting the directory elements in the canonical order. 15. The method of claim 1 , wherein the information from which the server computes the verification hash comprises an offset of a first file represented by the chunk associated with the hash, and a number of files represented by the chunk associated with the hash. 16. The method of claim 1 , wherein the verification hash is computed based at least in part on the information received from the client system and corresponding information stored at the remote server. 17. A computer system, comprising: a processor configured to: sort, in a canonical order, a list of directory elements wherein each directory element includes a canonical representation of metadata associated with a node in the filesystem; determine a chunk of directory elements comprising one or more consecutive directory elements by breaking up the sorted list of directory elements sorted in a canonical order; compute a hash of data comprising the chunk of directory elements comprising sorted in canonical order; determine based at least in part on the computed hash whether the corresponding directory elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system, wherein the determining whether the corresponding directory elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system comprises determining whether the computed hash is previously stored in a hash cache on the client system; and in the event that the computed cache was not previously stored in the hash cache, send, to the remote server, the computed hash and information from which the remote server computes a verification hash, wherein the computed hash is compared to the verification hash to determine whether the corresponding directly elements as stored on the remote server are identical to the directory elements comprising the chunk as stored on the client system; and send the one or more directory elements comprising the chunk to a remote server in the event it is determined based at least in part on the computed hash that corresponding directory elements as stored on the remote server are not identical to the directory elements comprising the chunk as stored on the computer system; and a storage device coupled to the processor and configured to store data comp

Assignees

Inventors

Classifications

  • Using snapshots, i.e. a logical point-in-time copy of the data · CPC title

  • Provision of network file services by network file servers, e.g. by using NFS, CIFS (network file access protocols H04L67/1097) · CPC title

  • Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title

  • Hash-based (content-based indexing of textual data G06F16/31) · CPC title

  • Asynchronous replication or reconciliation · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9235593B2 cover?
Transmitting filesystem changes over a network is disclosed. A hash of data comprising a chunk of directory elements comprising one or more consecutive directory elements in a set of elements sorted in a canonical order is computed at a client system. One or more directory elements comprising the chunk are sent to a remote server in the event it is determined based at least in part on the compu…
Who is the assignee on this patent?
Huang Mark, Anderson Curtis, Patterson R Hugo, and 1 more
What technology area does this patent fall under?
Primary CPC classification G06F16/178. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 12 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).