On 2012-04-04 22:05, Thomas Gummerer wrote:
-- 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.
Sounds like you're re-inventing one of these: http://code.google.com/p/leveldb/ http://code.google.com/p/high-concurrency-btree/ -- 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