ALL COVERED TOPICS

NoSQL Benchmarks NoSQL use cases NoSQL Videos NoSQL Hybrid Solutions NoSQL Presentations Big Data Hadoop MapReduce Pig Hive Flume Oozie Sqoop HDFS ZooKeeper Cascading Cascalog BigTable Cassandra HBase Hypertable Couchbase CouchDB MongoDB OrientDB RavenDB Jackrabbit Terrastore Amazon DynamoDB Redis Riak Project Voldemort Tokyo Cabinet Kyoto Cabinet memcached Amazon SimpleDB Datomic MemcacheDB M/DB GT.M Amazon Dynamo Dynomite Mnesia Yahoo! PNUTS/Sherpa Neo4j InfoGrid Sones GraphDB InfiniteGraph AllegroGraph MarkLogic Clustrix CouchDB Case Studies MongoDB Case Studies NoSQL at Adobe NoSQL at Facebook NoSQL at Twitter

NAVIGATE MAIN CATEGORIES

Close

Writes Performance: B+Tree, LSM Tree, Fractal Tree

Two excellent comments on Quora explaining the differences in the performance of write operation when using 3 different data structures: B+trees, Log-Structured Merge trees, and Fractal trees:

If you want me to spoil the fun of going through those answers, then Fractal tress are faster than LSM trees which are faster than B+tress. Interestingly enough, Fractal trees have more similar features to B-tress than LSM trees have.

Original title and link: Writes Performance: B+Tree, LSM Tree, Fractal Tree (NoSQL databases © myNoSQL)