A read-optimized index structure for distributed log-structured key-value store

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

Recently, Big Data processing is becoming a necessary technique to efficiently store, manage, and analyze massive data obtained by social media contents. NoSQL is one of databases that efficiently handle Big Data compared to the traditional database that has the limitation to manipulate Big Data. Log-structured key/value store, widely used in NoSQL, basically stores data into the disk storage in batch writing. Since this batch writing of the key/value store does not overwrite data in place, many data are accumulated in several places. Although it improves the write performance, the read performance decreases because the key/value store requires many accesses to widely-spread data. In order to address this problem, we propose T-tree index structure to reduce the search time by avoiding exploring contents stored in distributed many files. Finally, we show the performance improvement through the experimental results. © 2015 IEEE.

키워드

Bigdata; Database; Index; Key-value store; NoSQL; T-tree; Application programs; Computer software; Data handling; Database systems; Digital storage; Forestry; Trees (mathematics); Index; Index structure; Key-value stores; Log structured; Massive data; NoSQL; Read performance; T-trees; Big data
제목
A read-optimized index structure for distributed log-structured key-value store
저자
Kang, In su; Kim, Bo kyeong; Lee, Dong ho
DOI
10.1109/COMPSAC.2015.85
발행일
2015-07
유형
Conference Paper
저널명
Proceedings - IEEE Computer Society's International Computer Software and Applications Conference
페이지
650 ~ 651