244 0

A Read-Optimized Index Structure for Distributed Log-Structured Key-Value Store

Title
A Read-Optimized Index Structure for Distributed Log-Structured Key-Value Store
Author
이동호
Keywords
Bigdata; index; Big data; NoSQL; Key-value store; Indexes; T-tree; database
Issue Date
2015-07
Publisher
IEEE
Citation
2015 IEEE 39th Annual Computer Software and Applications Conference, Page. 650-651
Abstract
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.
URI
http://ieeexplore.ieee.org/document/7273449/https://repository.hanyang.ac.kr/handle/20.500.11754/101298
ISBN
978-1-4673-6564-2
ISSN
0730-3157
DOI
10.1109/COMPSAC.2015.85
Appears in Collections:
ETC[S] > 연구정보
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE