×

Quick filename lookup using name hash

  • US 10,614,032 B2
  • Filed: 09/02/2015
  • Issued: 04/07/2020
  • Est. Priority Date: 12/17/2004
  • Status: Active Grant
First Claim
Patent Images

1. A method, comprising:

  • receiving a target file name for a new directory entry set to be stored on a computer-readable storage medium;

    using a directory entry stored on the computer-readable storage medium to locate a conversion table, the directory entry being designated as a critical primary directory entry;

    converting the target file name to a converted version of the target file name in accordance with the conversion table stored on the computer-readable storage medium;

    generating a name hash of the converted version of the target file name, the name hash of the target file name being a function of the converted version of the target file name;

    for each existing directory entry set of a plurality of existing directory entry sets stored on the computer-readable storage medium;

    comparing the name hash with a corresponding name hash of a converted version of a file name of the existing directory entry set;

    determining a sure verification of mismatch for the existing directory entry set when the name hash and the corresponding name hash do not match; and

    allowing the target file name for the new directory entry set when a sure verification of mismatch has been determined for each of the plurality of existing directory entry sets,wherein generating a name hash of the converted version of the target file name comprises;

    determining the converted version of the target file name corresponds to one of a predetermined set of names, the predetermined set of names having a common prefix;

    determining a second portion corresponding to at least a portion of the converted version of the target file name excluding the common prefix;

    initializing a temporary value to a predetermined start value, the predetermined start value corresponding to the common prefix;

    for each character of the second portion;

    rotating the temporary value right by at least one bit; and

    adding the second value to the temporary value; and

    using the temporary value as the name hash.

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