A Direct Hashing Directory for Fast Inode Lookup
スポンサーリンク
概要
- 論文の詳細を見る
In a conventional file system, the directory tree is traversed to find the inode number of a file. The inode 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 inode 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.
- 社団法人電子情報通信学会の論文
- 2003-03-01
著者
-
HWANG Joo
Computer Engineering Research Laboratory, Department of Electrical Engineering and Computer Science
-
PARK Kyu
Computer Engineering Research Laboratory, Department of Electrical Engineering and Computer Science
-
Hwang Joo
Computer Engineering Research Laboratory Department Of Electrical Engineering And Computer Science K
-
Park Kyu
Computer Engineering Research Laboratory Department Of Electrical Engineering And Computer Science K
-
Park Kyu
Computer Engineering And Research Laboratory Dept. Of Electrical Engineering Korea Advanced Institut
関連論文
- A Scalable Multi-Host RAID-5 with Parity Consistency
- A Direct Hashing Directory for Fast Inode Lookup
- Range Image Segmentation Using Multiple Markov Random Fields
- A Method of 3D Object Reconstruction from a Series of Cross-Sectional Images (Special Issue on 3D Image Processing)