Comment by bcoates

Are there any comparisons between fractal trees and the database cracking/adaptive indices advocated by [1]? It seems like they're going after the same use pattern but cracking is relatively simpler and even faster for inserts.

[1] http://db.csail.mit.edu/pubs/abadi-column-stores.pdf