ptimal indexing would be 1 level [0:2] indexing or 2
levels [0:1] [2:3]. However it would be necessary to do some
benchmarking first before setting this to stone.
--
Tomas Mraz <[EMAIL PROTECTED]>
-
To unsubscribe from this list: send the line "unsubscribe git" in
the
ptimal indexing would be 1 level [0:2] indexing or 2
levels [0:1] [2:3]. However it would be necessary to do some
benchmarking first before setting this to stone.
--
Tomas Mraz <[EMAIL PROTECTED]>
-
To unsubscribe from this list: send the line "unsubscribe git" in
the
t about other operations
> on the database? I pity the poor program that has to `readdir' through
> millions of files.
Even with milions of files this key structure doesn't make much sense -
the keys on the first and second levels are too long. However you're
right that t
On Thu, 2005-04-21 at 11:09 +0200, Denys Duchier wrote:
> Tomas Mraz <[EMAIL PROTECTED]> writes:
>
> > If we suppose the maximum number of stored blobs in the order of milions
> > probably the optimal indexing would be 1 level [0:2] indexing or 2
> > levels [0
4 matches
Mail list logo
