lkml.org 
[lkml]   [2000]   [Feb]   [29]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: very large directories
    From
    Date
    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/

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