Messages in this thread | | | From | Bernd Eckenfels <> | Subject | Re: Designing Another File System | Date | Wed, 01 Dec 2004 05:32:29 +0100 |
| |
In article <cce9e37e04113018465091010f@mail.gmail.com> you wrote: > systems. The next release of Squashfs has considerably improved > indexed directories which are O(1) for large directories.
Are you talking about time complexity based on a named lookup over the number of files in a directory? (you might also want to look at the complexity relative to the naming component length). What data structure which is not wasting memory allows you those lookups? Even if you consider hashing the name as a constant O(1) operation (which it isnt), you still can get collisions.
Greetings Bernd - 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/
| |