Re: [GSoC] Designing a faster index format
- From
Noel Grandin <noelgrandin@gmail.com>
- Date
- Apr 5, 2012, 14:39 UTC
- Message-ID
- <4F7DAEB2.8080006@gmail.com>
- In-Reply-To
- <D97085E6-2B9F-42C5-A06D-B53422034071@gmail.com>
On 2012-04-04 22:05, Thomas Gummerer wrote:
Show 5 quoted lines
> -- 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/