Messages in this thread | | | From | Bas Mevissen <> | Subject | Re: Ext2fs and hashed table. | Date | Fri, 30 May 1997 12:36:08 +0200 (MET DST) |
| |
Daniel Ryde wrote: : : In this uppcomming trend of hashed tables, I wounder if it would be : possible to do something similar to a ext2 directory structure. When a : directory contains many files it takes a significant amount of time to : "find" a specific file. I think this time could be reduced, but would : it be possible using a hashed table? : : Well, just an idea. I leave it to you who know how it works. : : : -|- Daniel Ryde, Tripnet AB Tel: +46 31 7252500 : `-' System Administrator Fax: +46 31 7252501 : Maybe it is just time to write ext3, with the following features: 64 bit architecture very long files (gigabytes) (for dbases) compression raid support fast directory searching (by hashing of course) dynamic inode allocation (in directory tree e.g.)
Just an idea...
Bas.
-- ---------------------------------------------------------------- E-mail: sgm@stack.nl, S.G.A.H.Mevissen@stud.tue.nl PGP: Finger sgm@toad.stack.nl for PGP public key, KeyID 3B896721 WWW: www.stack.nl/~sgm (PGP public key here too) ----------------------------------------------------------------
| |