http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
LSM-tree 기반 Key-value 데이터베이스의 재귀적 컴팩션 기법
김종빈(Jongbin Kim),손서희(Seohui Son),조현수(Hyunsoo Cho),정형수(Hyungsoo Jung) Korean Institute of Information Scientists and Eng 2019 정보과학회논문지 Vol.46 No.9
LSM-tree-based key-value stores exhibit an optimized structure for data writing operations and typically maintain the form of LSM tree by executing a compaction operation. The compaction operation which reads data from the storage device into memory for sorting it and writes back the result data in to the storage device several times causes some problems. In this paper, we analyzed the performance degradation and the write amplification caused by the compaction, and proposed a new compaction method known as recursive compaction. Recursive compaction alleviates the problems involving the compaction operation by utilizing multiple threads to perform multiple compactions at a time, handling read operation and garbage collection properly. We implemented this technique for Google LevelDB and analyzed the results.