Cited time in webofscience Cited time in scopus

Full metadata record

DC Field Value Language
dc.contributor.advisor 이제민 -
dc.contributor.author Ilseop Lee -
dc.date.accessioned 2022-07-07T02:29:13Z -
dc.date.available 2022-07-07T02:29:13Z -
dc.date.issued 2021 -
dc.identifier.uri http://dgist.dcollection.net/common/orgView/200000364341 en_US
dc.identifier.uri http://hdl.handle.net/20.500.11750/16691 -
dc.description.abstract LSM-tree based key-value stores show high performance in write-intensive workloads due to the out-of-place update structure. However, this structure requires additional storage space to store a lot of redundant data in database and results in high space amplification. In order to remove redundant data, most modern LSM-tree stores use a compaction triggered by the capacity in each level. But the size-based compaction trigger often occurs inadequate compaction frequency according to the workload, causing high write amplification and reduces overall performance. To address this, we introduce delete-aware compaction trigger which responds to the current workload’s deletion rates and reduces ineffi-cient compactions consisting of most valid records. We implemented Delete-Aware RocksDB on top of RocksDB, and we show that it outperforms by keeping low space amplification without write amplifica-tion cost compared to RocksDB. Furthermore, we show our system cooperated with Monkey, one of the state-of-the-art LSM-tree based key-value store, outperforms existing systems in terms of throughput. -
dc.description.statementofresponsibility Y -
dc.description.tableofcontents Ⅰ. Introduction 1
1.1 Motivation 2
1.1.1 Lifecycle of a deletion record and inefficiency in a compaction 2
1.1.2 Maintaining low space amplification decreases overall performance 3
1.2 Research Goals and Thesis Structure 5
1.2.1 Goal 1: To make a compaction efficient according to the workload 5
1.2.2 Goal 2: To trigger a compaction at the proper time 5
1.2.3 Thesis Structure 5
ⅠⅠ. Background 6
2.1 LSM-Tree Basics 6
2.1.1 Memtable and SSTable 6
2.1.2 Compaction 8
2.1.3 Bloom Filter 9
2.2 Amplification Factors 10
2.2.1 Read Amplification 10
2.2.2 Write Amplification 10
2.2.3 Space Amplification 11
ⅠⅠⅠ. Implementation 12
3.1 Implementing Delete-Aware RocksDB 13
3.1.1 A delete-aware compaction trigger 13
3.1.2 Pre-remove strategy for redundant tombstones 16
3.1.3 Dynamic runtime adaptation 17
3.2 Extending db_bench 20
3.2.1 Flags 20
3.2.2 Configuration of Delete-Aware RocksDB 20
3.3 Cooperation with Monkey Method 21
ⅠV. Benchmarks 23
4.1 Experimental Setup 23
4.2 Throughput 24
4.3 The Number of Compactions and Space Amplification 25
V. Discussion 27
VI. Conclusion 28
References 29
-
dc.format.extent 31 -
dc.language eng -
dc.publisher DGIST -
dc.subject LSM-Tree,Compaction trigger -
dc.title A Delete-Aware Compaction Trigger Method for LSM-Tree Based Key-Value Stores -
dc.title.alternative LSM-Tree 기반의 키-값 저장소를 위한 삭제 인지 컴팩션 트리거 방법 -
dc.type Thesis -
dc.identifier.doi 10.22677/thesis.200000364341 -
dc.description.alternativeAbstract LSM 트리 기반 키-값 저장소는 out-of-place 업데이트 구조로 인해 쓰기 집약적인 워크로드에서 높은 성능을 보인다. 그러나 이 구조는 데이터베이스에 많은 중복 데이터의 저장을 필요로 하며, 결과적으로 높은 공간 증폭이 발생한다. 중복 데이터를 제거하기 위해 대부분의 최신 LSM 트리 저장소는 트리 각 레벨의 용량에 따라 트리거되는 컴팩션을 사용하지만, 이는 현재 워크로드에 따른 컴팩션 주기를 결정하기 어렵다. 잦은 컴팩션은 높은 쓰기 증폭을 수반하여 전반적인 성능을 감소 시킬 수 있어 중요하다. 이를 해결하기 위해 현재 워크로드의 삭제 비율을 반영하는 삭제 인식 컴팩션 트리거를 제안한다. 삭제 비율 기반 압축 트리거를 통해, 기존의 크기 기반 압축 트리거로 인해 발생하는 추가적인 컴팩션 및 대부분의 유효한 데이터 간의 비효율적인 컴팩션을 줄인다. 본 논문은 RocksDB를 활용해 Delete-Aware RocksDB 를 구현했으며, 쓰기 증폭 비용없이 낮은 공간 증폭을 유지하여 RocksDB에 비해 성능이 우수함을 보인다. 또한, 최신 성능의 LSM 트리 기반 키-값 저장소 중 하나인 Monkey방법과의 협력을 통한 높은 성능을 보인다. -
dc.description.degree Master -
dc.contributor.department Information and Communication Engineering -
dc.contributor.coadvisor Min-Soo Kim -
dc.date.awarded 2021/02 -
dc.publisher.location Daegu -
dc.description.database dCollection -
dc.citation XT.IM 이68 202102 -
dc.contributor.alternativeDepartment 정보통신융합전공 -
dc.contributor.affiliatedAuthor Ilseop Lee -
dc.contributor.affiliatedAuthor Jemin Lee -
dc.contributor.affiliatedAuthor Min-Soo Kim -
dc.contributor.alternativeName 이일섭 -
dc.contributor.alternativeName Jemin Lee -
dc.contributor.alternativeName 김민수 -
Files in This Item:
200000364341.pdf

200000364341.pdf

기타 데이터 / 2 MB / Adobe PDF download
Appears in Collections:
Department of Electrical Engineering and Computer Science Theses Master

qrcode

  • twitter
  • facebook
  • mendeley

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE