A library that provides an embeddable, persistent key-value store for fast storage.
e0aa19a94e
Summary: as title. Some result: -- Sequential insertion of 1M key/value with stock skip list (all in on memtable) time ./perf_context_test --total_keys=1000000 --use_set_based_memetable=0 Inserting 1000000 key/value pairs ... Put uesr key comparison: Count: 1000000 Average: 8.0179 StdDev: 176.34 Min: 0.0000 Median: 2.5555 Max: 88933.0000 Percentiles: P50: 2.56 P75: 2.83 P99: 58.21 P99.9: 133.62 P99.99: 987.50 Get uesr key comparison: Count: 1000000 Average: 43.4465 StdDev: 379.03 Min: 2.0000 Median: 36.0195 Max: 88939.0000 Percentiles: P50: 36.02 P75: 43.66 P99: 112.98 P99.9: 824.84 P99.99: 7615.38 real 0m21.345s user 0m14.723s sys 0m5.677s -- Sequential insertion of 1M key/value with set based memtable (all in on memtable) time ./perf_context_test --total_keys=1000000 --use_set_based_memetable=1 Inserting 1000000 key/value pairs ... Put uesr key comparison: Count: 1000000 Average: 61.5022 StdDev: 6.49 Min: 0.0000 Median: 62.4295 Max: 71.0000 Percentiles: P50: 62.43 P75: 66.61 P99: 71.00 P99.9: 71.00 P99.99: 71.00 Get uesr key comparison: Count: 1000000 Average: 29.3810 StdDev: 3.20 Min: 1.0000 Median: 29.1801 Max: 34.0000 Percentiles: P50: 29.18 P75: 32.06 P99: 34.00 P99.9: 34.00 P99.99: 34.00 real 0m28.875s user 0m21.699s sys 0m5.749s Worst case comparison for a Put is 88933 (skiplist) vs 71 (set based memetable) Of course, there's other in-efficiency in set based memtable implementation, which lead to the overall worst performance. However, P99 behavior advantage is very very obvious. Test Plan: ./perf_context_test and viewstate shadow testing Reviewers: dhruba Reviewed By: dhruba CC: leveldb Differential Revision: https://reviews.facebook.net/D13095 |
||
---|---|---|
build_tools | ||
coverage | ||
db | ||
doc | ||
hdfs | ||
helpers/memenv | ||
include | ||
java | ||
linters/src | ||
port | ||
scribe | ||
snappy | ||
table | ||
thrift | ||
tools | ||
util | ||
utilities | ||
.arcconfig | ||
.gitignore | ||
LICENSE | ||
Makefile | ||
README | ||
README.fb |
rocksdb: A persistent key-value store for flash storage Authors: * The Facebook Database Engineering Team * Build on earlier work on leveldb by Sanjay Ghemawat (sanjay@google.com) and Jeff Dean (jeff@google.com) This code is a library that forms the core building block for a fast key value server, especially suited for storing data on flash drives. It has an Log-Stuctured-Merge-Database (LSM) design with flexible tradeoffs between Write-Amplification-Factor(WAF), Read-Amplification-Factor (RAF) and Space-Amplification-Factor(SAF). It has multi-threaded compactions, making it specially suitable for storing multiple terabytes of data in a single database. The core of this code has been derived from open-source leveldb. The code under this directory implements a system for maintaining a persistent key/value store. See doc/index.html for more explanation. See doc/impl.html for a brief overview of the implementation. The public interface is in include/*. Callers should not include or rely on the details of any other header files in this package. Those internal APIs may be changed without warning. Guide to header files: include/rocksdb/db.h Main interface to the DB: Start here include/rocksdb/options.h Control over the behavior of an entire database, and also control over the behavior of individual reads and writes. include/rocksdb/comparator.h Abstraction for user-specified comparison function. If you want just bytewise comparison of keys, you can use the default comparator, but clients can write their own comparator implementations if they want custom ordering (e.g. to handle different character encodings, etc.) include/rocksdb/iterator.h Interface for iterating over data. You can get an iterator from a DB object. include/rocksdb/write_batch.h Interface for atomically applying multiple updates to a database. include/rocksdb/slice.h A simple module for maintaining a pointer and a length into some other byte array. include/rocksdb/status.h Status is returned from many of the public interfaces and is used to report success and various kinds of errors. include/rocksdb/env.h Abstraction of the OS environment. A posix implementation of this interface is in util/env_posix.cc include/rocksdb/table_builder.h Lower-level modules that most clients probably won't use directly include/rocksdb/cache.h An API for the block cache. include/rocksdb/compaction_filter.h An API for a application filter invoked on every compaction. include/rocksdb/filter_policy.h An API for configuring a bloom filter. include/rocksdb/memtablerep.h An API for implementing a memtable. include/rocksdb/statistics.h An API to retrieve various database statistics. include/rocksdb/transaction_log.h An API to retrieve transaction logs from a database.