Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

A Directory Index for EXT2

In recent years, filesystem designers have tended to favor the use of BTrees and variants thereof to eliminate directory performance bottlenecks. The idea of adding BTree directory indexing to Linux's Ext2 filesystem has been much discussed but never implemented, more probably due to an aversion to complexity than any laziness on the part of developers. Recently, I conceived and implemented a new kind of indexing technique using hashed keys held in a uniform-depth tree. I gave this structure the name "HTree". Compared to a BTree, the HTree has a considerable simpler implementation but offers similar performance. Furthermore, it turned out to be possible to achieve not only backward compatibility with existing Ext2 filesystems, but forward compatibility with earlier versions of Linux as well.

Daniel Phillips

BibTeX
@inproceedings {270839,
author = {Daniel Phillips},
title = {A Directory Index for {EXT2}},
booktitle = {5th Annual Linux Showcase \& Conference (ALS 01)},
year = {2001},
address = {Oakland, CA},
url = {https://www.usenix.org/conference/als-01/directory-index-ext2},
publisher = {USENIX Association},
month = nov
}
Download

Links

Paper: 
http://www.usenix.org/publications/library/proceedings/als01/full_papers/phillips/phillips.pdf
Paper (HTML): 
http://www.usenix.org/publications/library/proceedings/als01/full_papers/phillips/phillips_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us