Fragmentation is a hard problem for databases. A b-tree is likely - TopicsExpress



          

Fragmentation is a hard problem for databases. A b-tree is likely to have an average fill factor of 50% to 70% after a sequence of random updates and deletes. A write optimized database has something similar from old versions of rows that have yet to be removed from disk. MongoDB has something similar via record padding done to leave space on disk pages for document growth. Rongrong will describe her work on reducing fragmentation for InnoDB at the UC. She has been hacking on InnoDB to make things better and the results look good. docs.mongodb.org/manual/core/record-padding/ https://percona/live/mysql-conference-2014/sessions/innodb-defragmentation
Posted on: Sat, 18 Jan 2014 16:35:55 +0000

Trending Topics



Recently Viewed Topics




© 2015