LevelDB场景分析1--整体结构分析
基本用法
数据结构
class DBImpl : public DB
{
private:struct CompactionState;struct Writer;// Information kept for every waiting writerEnv* const env_; // 文件,目录,日志,Schedule线程const InternalKeyComparator internal_comparator_;const InternalFilterPolicy internal_filter_policy_; // 提高随机读的性能const Options options_; // Options to control the behavior of a database (passed to DB::Open)bool owns_info_log_;bool owns_cache_;const std::string dbname_;// table_cache_ provides its own synchronizationTableCache* table_cache_;// Lock over the persistent DB state. Non-NULL iff successfully acquired.FileLock* db_lock_;// State below is protected by mutex_port::Mutex mutex_;port::AtomicPointer shutting_down_;port::CondVar bg_cv_; // Signalled when background work finishesMemTable* mem_;MemTable* imm_; // Memtable being compactedport::AtomicPointer has_imm_; // So bg thread can detect non-NULL imm_WritableFile* logfile_;uint64_t logfile_number_;log::Writer* log_;uint32_t seed_; // For sampling.// Queue of writers.std::deque<Writer*> writers_;WriteBatch* tmp_batch_;SnapshotList snapshots_;// Set of table files to protect from deletion because they are// part of ongoing compactions.std::set<uint64_t> pending_outputs_;// Has a background compaction been scheduled or is running?bool bg_compaction_scheduled_;ManualCompaction* manual_compaction_;VersionSet* versions_;// Have we encountered a background error in paranoid mode?Status bg_error_;CompactionStats stats_[config::kNumLevels];
};
红色部分成员是需要重点关注的。
主要场景
public:Status DB::Open(const Options& options, const std::string& dbname, DB** dbptr)
// Implementations of the DB interface
virtual Status Put(const WriteOptions&, const Slice& key, const Slice& value);virtual Status Delete(const WriteOptions&, const Slice& key);virtual Status Write(const WriteOptions& options, WriteBatch* updates);virtual Status Get(const ReadOptions& options,const Slice& key,std::string* value);virtual Iterator* NewIterator(const ReadOptions&);virtual const Snapshot* GetSnapshot();virtual void ReleaseSnapshot(const Snapshot* snapshot);virtual bool GetProperty(const Slice& property, std::string* value);virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes);virtual void CompactRange(const Slice* begin, const Slice* end);// Extra methods (for testing) that are not in the public DB interface// Record a sample of bytes read at the specified internal key.// Samples are taken approximately once every config::kReadBytesPeriod// bytes.void RecordReadSample(Slice key);
private:
Iterator* NewInternalIterator(const ReadOptions&,SequenceNumber* latest_snapshot,uint32_t* seed);Status NewDB();// Recover the descriptor from persistent storage. May do a significant// amount of work to recover recently logged updates. Any changes to// be made to the descriptor are added to *edit.Status Recover(VersionEdit* edit) EXCLUSIVE_LOCKS_REQUIRED(mutex_);void MaybeIgnoreError(Status* s) const;// Delete any unneeded files and stale in-memory entries.void DeleteObsoleteFiles();// Compact the in-memory write buffer to disk. Switches to a new// log-file/memtable and writes a new descriptor iff successful.// Errors are recorded in bg_error_.void CompactMemTable() EXCLUSIVE_LOCKS_REQUIRED(mutex_);Status RecoverLogFile(uint64_t log_number,VersionEdit* edit,SequenceNumber* max_sequence)EXCLUSIVE_LOCKS_REQUIRED(mutex_);Status WriteLevel0Table(MemTable* mem, VersionEdit* edit, Version* base)EXCLUSIVE_LOCKS_REQUIRED(mutex_);Status MakeRoomForWrite(bool force /* compact even if there is room? */)EXCLUSIVE_LOCKS_REQUIRED(mutex_);WriteBatch* BuildBatchGroup(Writer** last_writer);void RecordBackgroundError(const Status& s);void MaybeScheduleCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_);static void BGWork(void* db);void BackgroundCall();void BackgroundCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_);void CleanupCompaction(CompactionState* compact)EXCLUSIVE_LOCKS_REQUIRED(mutex_);Status DoCompactionWork(CompactionState* compact)EXCLUSIVE_LOCKS_REQUIRED(mutex_);Status OpenCompactionOutputFile(CompactionState* compact);Status FinishCompactionOutputFile(CompactionState* compact, Iterator* input);Status InstallCompactionResults(CompactionState* compact)EXCLUSIVE_LOCKS_REQUIRED(mutex_);
综合介绍
LevelDB主要有以下几个部分的内存开销:memtable,immutable table,table cache,block cache
memtable和immutable table的大小由 options_.write_buffer_size决定。
table cache由max_open_files决定数量。
block cache最大可以传入 size_t的大小。
由于使用了mmap,因此需要尽量使内存大于数据规模。否则可能造成随机读爆慢。
LevelDB场景分析1--整体结构分析的更多相关文章
- LevelDB场景分析4--BackgroundCompaction
1.DBImpl::Open uint64_t new_log_number = impl->versions_->NewFileNumber(); WritableF ...
- LevelDB场景分析2--Open
1.源码 1 Status DB::Open(const Options& options, const std::string& dbname, uint64_t new_ ...
- EasyNVR智能云终端硬件使用场景分析:如何实现软硬一体的视频上云整体解决方案
背景分析 在于众多的客户交流中,经常会被客户问到,"EasyNVR到底是软件还是硬件?"."EasyNVR能否出一个硬件的版本,摆脱自建服务器的压力?".&qu ...
- [阿里DIN] 深度兴趣网络源码分析 之 整体代码结构
[阿里DIN] 深度兴趣网络源码分析 之 整体代码结构 目录 [阿里DIN] 深度兴趣网络源码分析 之 整体代码结构 0x00 摘要 0x01 文件简介 0x02 总体架构 0x03 总体代码 0x0 ...
- JVM之调优及常见场景分析
JVM调优 GC调优是最后要做的工作,GC调优的目的可以总结为下面两点: 减少对象晋升到老年代的数量 减少FullGC的执行时间 通过监控排查问题及验证优化结果,可以分为: 命令监控:jps.jinf ...
- TYPESDK手游聚合SDK服务端设计思路与架构之一:应用场景分析
TYPESDK 服务端设计思路与架构之一:应用场景分析 作为一个渠道SDK统一接入框架,TYPESDK从一开始,所面对的需求场景就是多款游戏,通过一个统一的SDK服务端,能够同时接入几十个甚至几百个各 ...
- Duilib源码分析(六)整体流程
在<Duilib源码分析(一)整体框架>.<Duilib源码分析(二)控件构造器—CDialogBuilder>以及<Duilib源码分析(三)XML解析器—CMarku ...
- Oracle dbms_lock.sleep()存储过程使用技巧-场景-分析-实例
<Oracle dbms_lock.sleep()存储过程使用技巧>-场景-分析-实例 摘要:今天是2014年3月10日,北京,雾霾,下午组织相关部门开会.会议的结尾一名开发工程师找到了我 ...
- 理解 python metaclass使用技巧与应用场景分析
理解python metaclass使用技巧与应用场景分析 参考: decorator与metaclass:http://jfine-python-classes.readthedocs. ...
随机推荐
- Android中的树状(tree)列表
树状列表前端挺常用的,还有人专门写过Ztree,Android中有的时候也需要使用到树状列表,上篇文章写了一下ExpandableListView,ExpandableListView最多支持两级结构 ...
- 【架构】Kubernetes和Spring Cloud哪个部署微服务更好?
Spring Cloud 和Kubernetes都自称自己是部署和运行微服务的最好环境,但是它们在本质上和解决不同问题上是有很大差异的.在本文中,我们将看到每个平台如何帮助交付基于微服务的架构(MSA ...
- 查看sedna创建的数据库和集合,文档之类
在sedna的安装文件夹下.看一下cfg文件夹: <pre name="code" class="plain">[xuzhina@localhost ...
- php实现支付宝授权登录
第一步: 登录到蚂蚁金服开放平台https://open.alipay.com/platform/home.htm,前提是有商户号.创建应用之后,然后到开发者中心开通对应功能.如图: 第二步: 到应用 ...
- [Javascipt] Immediately-Invoker 2
Now the people at Poplar Puzzles would like you to treat an array of functions like a Queue, passing ...
- 【leetcode 桶排序】Maximum Gap
1.题目 Given an unsorted array, find the maximum difference between the successive elements in its sor ...
- 基于Mongodb进行分布式数据存储
http://blog.csdn.net/daizhj/article/details/5868360 注:本文是研究Mongodb分布式数据存储的副产品,通过本文的相关步骤可以将一个大表中的数据分布 ...
- Oracle 11g 更改字符集
查看字符集: select * from v$nls_parameters where parameter = 'NLS_CHARACTERSET'; 修改字符集: sqlplus "/as ...
- HDU 2795 Billboard (线段树)
Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total ...
- 使用JDK自带的Stax操作XML
操作的books.xml <?xml version="1.0" encoding="UTF-8"?> <bookstore> < ...
