lkml.org 
[lkml]   [1997]   [May]   [31]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Ext2fs and hashed table.

How about we just get that undelete flag doing something useful in ext2
first before we think about ext3, eh? ext2 *still* isnt finished. Ted,
c'mon man, we need you doing ext2, cant libc wait a bit?

One more idea for ext3 though... (yeah, we do need it), change reclen from
12 to 16. Or maybe even 32. That might speed things up some.

On Fri, 30 May 1997, Bas Mevissen wrote:
> Maybe it is just time to write ext3, with the following features:
> 64 bit architecture
an easy couple weeks work for someone who has access to a 64 bit machine

> very long files (gigabytes) (for dbases)
already done I thought?

> compression
patches already exist

> raid support
supported in kernel....

> fast directory searching (by hashing of course)
no way. b-trees are the *right* way to do it.

> dynamic inode allocation (in directory tree e.g.)
sure. uhhhh, what does it do anyways?

SirDibos

www.linuxos.com



\
 
 \ /
  Last update: 2005-03-22 13:39    [W:0.138 / U:1.156 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site