CinHBa: A secondary index with hotscore caching policy on key-value data store

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We are now entering the era of big data. HBase comes out to organize data as key-value pairs and support fast queries on rowkeys, but queries on non-rowkey column are a blind spot of HBase. It is the main topic of this paper to provide high-performance query capability on non-rowkey column. An effective secondary index model is proposed, and the prototype system CinHBa is implemented. Furthermore, a novel caching policy, Hotscore Algorithm, is introduced in CinHBa to cache hottest index data into memory to improve query performance. Experiment evaluation shows that query response time of CinHBa is far less than native HBase without secondary index on 10M records. Besides that, CinHBa has good data scalability.

Cite

CITATION STYLE

APA

Ge, W., Huang, Y., Zhao, D., Luo, S., Yuan, C., Zhou, W., … Zhou, J. (2014). CinHBa: A secondary index with hotscore caching policy on key-value data store. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8933, 602–615. https://doi.org/10.1007/978-3-319-14717-8_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free