TY - GEN
T1 - Deferred lightweight indexing for log-structured key-value stores
AU - Tang, Yuzhe
AU - Iyengar, Arun
AU - Tan, Wei
AU - Fong, Liana
AU - Liu, Ling
AU - Palanisamy, Balaji
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/7/7
Y1 - 2015/7/7
N2 - The recent shift towards write-intensive workload on bigdata (e.g., financial trading, social user-generated data streams)has pushed the proliferation of log-structured key-value stores, represented by Google's BigTable [1], Apache HBase [2] andCassandra [3]. While providing key-based data access with aPut/Get interface, these key-value stores do not support value-based access methods, which significantly limits their applicability in modern web and database applications. In this paper, we present DELI, a DEferred Lightweight Indexing scheme on the log-structured key-value stores. To index intensively updated bigdata in real time, DELI aims at making the index maintenance as lightweight as possible. The key idea is to apply an append-only design for online index maintenance and to collect index garbage at carefully chosen time. DELI optimizes the performance of index garbage collection through tightly coupling its execution with a native routine process called compaction. The DELI'ssystem design is fault-tolerant and generic (to most key-valuestores), we implemented a prototype of DELI based on HBasewithout internal code modification. Our experiments show that the DELI offers significant performance advantage for the write-intensive index maintenance.
AB - The recent shift towards write-intensive workload on bigdata (e.g., financial trading, social user-generated data streams)has pushed the proliferation of log-structured key-value stores, represented by Google's BigTable [1], Apache HBase [2] andCassandra [3]. While providing key-based data access with aPut/Get interface, these key-value stores do not support value-based access methods, which significantly limits their applicability in modern web and database applications. In this paper, we present DELI, a DEferred Lightweight Indexing scheme on the log-structured key-value stores. To index intensively updated bigdata in real time, DELI aims at making the index maintenance as lightweight as possible. The key idea is to apply an append-only design for online index maintenance and to collect index garbage at carefully chosen time. DELI optimizes the performance of index garbage collection through tightly coupling its execution with a native routine process called compaction. The DELI'ssystem design is fault-tolerant and generic (to most key-valuestores), we implemented a prototype of DELI based on HBasewithout internal code modification. Our experiments show that the DELI offers significant performance advantage for the write-intensive index maintenance.
KW - Indexing
KW - Key-value stores
KW - Log-structured
KW - NoSQL
KW - Secondary index
UR - http://www.scopus.com/inward/record.url?scp=84941201863&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84941201863&partnerID=8YFLogxK
U2 - 10.1109/CCGrid.2015.150
DO - 10.1109/CCGrid.2015.150
M3 - Conference contribution
AN - SCOPUS:84941201863
T3 - Proceedings - 2015 IEEE/ACM 15th International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015
SP - 11
EP - 20
BT - Proceedings - 2015 IEEE/ACM 15th International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015
Y2 - 4 May 2015 through 7 May 2015
ER -