Please download the dossier by clicking on the dossier button x
×

Removing overlapping ranges from a flat sorted data structure

  • US 9,720,928 B2
  • Filed: 10/20/2014
  • Issued: 08/01/2017
  • Est. Priority Date: 03/01/2012
  • Status: Active Grant
First Claim
Patent Images

1. A computer implemented method for removing one or more stale fingerprints from a fingerprint database the method comprising:

  • sorting a list of stale fingerprints stored in a stale fingerprint data structure into an inode number order;

    performing an attributes intersect range calculation on the sorted list that computes a non-overlapping and latest consistency point (CP) range, wherein the attributes intersect range calculation comprises determining a tuple that defines the non-overlapping and latest CP range, wherein the tuple includes a starting value, an ending value, and a CP count associated with a given inode; and

    comparing the non-overlapping and latest CP range with the fingerprint database wherein the comparing includes;

    determining whether an identifier, associated with a block of data, is located between the starting value and the ending value,in response to determining that the identifier is located between the starting value and the ending value, determining whether one or more selected fingerprints associated with the block of data and in the fingerprint database have a specific CP count that is less than or equal to the CP count contained in the non-overlapping and latest CP range, andremoving from the fingerprint database the one or more selected fingerprints associated with the block of data and in the fingerprint database that have the specific CP count that is less than or equal to the CP count contained in the non-overlapping and latest CP range, wherein the one or more selected fingerprints that have the specific CP count that is less than or equal to the CP count are stale fingerprints.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×