A direct hashing directory for fast inode lookup

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 312
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorHwang, JYko
dc.contributor.authorPark, Kyu Hoko
dc.date.accessioned2013-03-04T19:07:48Z-
dc.date.available2013-03-04T19:07:48Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2003-03-
dc.identifier.citationIEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E86D, pp.641 - 644-
dc.identifier.issn0916-8532-
dc.identifier.urihttp://hdl.handle.net/10203/83761-
dc.description.abstractIn 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.-
dc.languageEnglish-
dc.publisherIEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG-
dc.titleA direct hashing directory for fast inode lookup-
dc.typeArticle-
dc.identifier.wosid000181421800033-
dc.identifier.scopusid2-s2.0-0038380987-
dc.type.rimsART-
dc.citation.volumeE86D-
dc.citation.beginningpage641-
dc.citation.endingpage644-
dc.citation.publicationnameIEICE TRANSACTIONS ON INFORMATION AND SYSTEMS-
dc.contributor.localauthorPark, Kyu Ho-
dc.contributor.nonIdAuthorHwang, JY-
dc.type.journalArticleLetter-
dc.subject.keywordAuthordirectory-
dc.subject.keywordAuthorfile system-
dc.subject.keywordAuthorhashing-
dc.subject.keywordAuthoroperating system-
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