Re:MySQL is bazillion times faster than MemSQL
by Nitramp on Tuesday June 26, 2012 @05:15PM
(#4164170)
You could probably pull that off if you implement it like full text search indices in e.g. Lucene. Have every modification create a "diff" skip list that takes precedence over older skip lists, and then have a merge operation that runs asynchronously (and will either have to lock, or copy the entire data structure and switch it in atomically). That's also essentially how Bigtable's disk format works.
[ Parent
| on HN ]
There are no comments on this comment yet.