×

Efficient deduplicated data storage with tiered indexing

  • US 8,700,634 B2
  • Filed: 12/29/2011
  • Issued: 04/15/2014
  • Est. Priority Date: 12/29/2011
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method comprising:

  • accessing, at a server, a dedupe entry in a dedupe database, the dedupe database stored in a first storage, the dedupe entry comprising a reference count and a first checksum, the first checksum computed from a block data entry;

    determining if the dedupe entry satisfies an indexing condition, the indexing condition comprising a comparison of the reference count against a watermark cutoff counter;

    responsive to the dedupe entry satisfying the indexing condition, creating a dedupe index entry, the dedupe index entry comprising a copy of the first checksum, and storing the dedupe index entry in a hyperindex, the hyperindex stored in a second storage;

    receiving a request from a user client to store user data, the request comprising a second checksum computed from at least a portion of the user data, the second checksum equal to the first checksum; and

    responsive to receiving the request, locating the dedupe index entry by matching the second checksum to the copy of the first checksum in the dedupe index entry.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×