Messages in this thread | | | Subject | Re: very large directories | From | Martin Schulz <> | Date | 29 Feb 2000 17:12:41 +0100 |
| |
Matti Aarnio <matti.aarnio@sonera.fi> writes:
> There has been talk about having B-tree on-disk datastructures > for directory processing. Nothing visible of it yet.
IIRC, Reiserfs implements a tree-like strukture. Other possibilities include subdirectories with hash-values as names, as used for the "netscape.cache" directory.
-- Martin Schulz schulz@iwrmm.math.uni-karlsruhe.de Uni Karlsruhe, Institut f. wissenschaftliches Rechnen u. math. Modellbildung Engesser Str. 6, 76128 Karlsruhe
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |