Messages in this thread | | | Date | Thu, 22 Feb 2001 00:07:55 +0100 | From | Martin Mares <> | Subject | Re: [rfc] Near-constant time directory index for Ext2 |
| |
Hello!
> True. Note too, though, that on a filesystem (which we are, after all, > talking about), if you assume a large linear space you have to create a > file, which means you need to multiply the cost of all random-access > operations with O(log n).
One could avoid this, but it would mean designing the whole filesystem in a completely different way -- merge all directories to a single gigantic hash table and use (directory ID,file name) as a key, but we were originally talking about extending ext2, so such massive changes are out of question and your log n access argument is right.
Have a nice fortnight -- Martin `MJ' Mares <mj@ucw.cz> <mj@suse.cz> http://atrey.karlin.mff.cuni.cz/~mj/ COBOL -- Completely Outdated, Badly Overused Language - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |