A post on Tokutek’s blog explaining TokuMX, the fractal tree-based storage engine for MongoDB:
TokuMX has replaced ALL of the storage code in MongoDB with fractal trees. […]
TokuMX achieves high compression for the same reason TokuDB for MySQL does:
fractal trees compress really well by ensuring they compress data in large
chunks. TokuMX achieves high insertion rates on index-rich collections for
the same reason TokuDB for MySQL performs so well on iiBench, fractal trees
are a write-optimized data structure designed to maintain insertion
performance on larger than memory workloads. TokuMX does not require
constant compaction for the same reason that TokuDB for MySQL does not
require users to constantly run “optimize table” to reorganize data, fractal
trees don’t fragment. MongoDB and MySQL are very different products with
very different user experiences, but the underlying data structure of their
storage is the same: the B-Tree. Fractal trees are better.
The post has a lot of links to go through.
✚ Has Tokutek published any papers about the fractal tree engine? I remember reading that the technology was waiting to be patented, but I don’t think I’ve found any papers about it.
Original title and link: What is TokuMX fractal tree-based storage? ( ©myNoSQL)