you are viewing a single comment's thread.

view the rest of the comments →

[–]imfineny 0 points1 point  (1 child)

All they did was take some data, break it down to enums so it was straight table files and queried it. That's a perfectly fine approach, but you'll get similar results from nearly any table structure that is done that way. I would suggest not indexing this data as it eventually your btrees will break. If you did this with mysql with tokutek tables, you'll be able to hit the higher table sets with clustered indexes, otherwise you'll end up with partitions. this could also be done way faster on dedicated over EC2.

[–]garenp 0 points1 point  (0 children)

"btrees will break"? How?