A direct hashing directory for fast inode lookup

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 311
  • Download : 0
In a conventional file system, the directory tree is traversed to find the inode number of a file. The mode lookup performance degrades as the size of the directory tree increases. In this letter, a new directory scheme, called direct hashing directory, is proposed. The mode number of a file is the cyclic redundancy code of the file's absolute path name such that the inode number can be computed directly. The average number of disk accesses for inode lookup is 1.08, which is order of magnitude faster than the conventional directory schemes such as hashing, B tree, and sequential directory.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2003-03
Language
English
Article Type
Letter
Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E86D, pp.641 - 644

ISSN
0916-8532
URI
http://hdl.handle.net/10203/83761
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0