Thursday, December 19


Why Little Bobby Tables Can't Count

The Huffington Post* has an interesting article on why counting operations are slower on good databases than bad ones.  It's by one of the engineers at Tokutek, who develop TokuMX - and yes, count() requests are slower in TokuMX than MongoDB.

It doesn't sound like there's any fundamental problem with implementing counted trees to improve count performance, just that the finer the lock grain and the higher the throughput of your database, the higher the overhead per operation of maintaining those counts - because you'd be maintaining multiple overlapping versions of the counts simultaneously.

Which is not insoluble, just icky.

* Of all places.

Posted by: Pixy Misa at 09:54 AM | Comments (1) | Add Comment | Trackbacks (Suck)
Post contains 110 words, total size 1 kb.

1 Thumbs up for the XKCD reference.

Posted by: GreyDuck at Friday, December 20 2013 12:37 AM (CUkqs)

Hide Comments | Add Comment

Comments are disabled. Post is locked.
45kb generated in CPU 0.0379, elapsed 0.3129 seconds.
56 queries taking 0.2888 seconds, 340 records returned.
Powered by Minx 1.1.6c-pink.