Thomas Gummerer <italyhockeyfeed@xxxxxxxxx> writes:
> -- Proposed solution --
> The proposed solution is to redesign the index to a B-tree based format. This
> allows changes to the index in O(log(n)) time, with n being the number of
> entries in the index.
> -- Solutions that were also considered --
> - Append-only data structure
> - Database format
> - Padded structure
This is quite complete already, which I think is great, but it's still
missing one "obvious" approach: a directory-tree based layout that uses
"flat" storage. That is, the entries grouped by directory and thus
arranged into the "natural" tree, so as to allow parsing only part of
it. But not pulling any tricks to make it easy to change; a nontrivial
change would mean a rewrite. How good do you think that could be?
--
Thomas Rast
trast@{inf,student}.ethz.ch
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html