상세 보기
A read-optimized index structure for distributed log-structured key-value store
- Kang, In su;
- Kim, Bo kyeong;
- Lee, Dong ho
WEB OF SCIENCE
0SCOPUS
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.
키워드
- 제목
- A read-optimized index structure for distributed log-structured key-value store
- 저자
- Kang, In su; Kim, Bo kyeong; Lee, Dong ho
- 발행일
- 2015-07
- 유형
- Conference Paper
- 저널명
- Proceedings - IEEE Computer Society's International Computer Software and Applications Conference
- 페이지
- 650 ~ 651
- 언어
- ENG
- 출판사
- IEEE
- 분량
- 2 페이지
- ISSN
- P 0730-6512