BF-Matrix: A secondary index for the cloud storage

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

Abstract

Although people have proposed many kinds of NoSQL databases, also referred as Key-Value stores, there is still lack of an efficient solution for the problem of non-key attribute queries. In this paper, we propose BF-Matrix, a hierarchical index composed of bloom filter and B+ tree. Faced with the massive data and the large scale cluster, the layered solution could shorten the search path and make the best of scattered resources. Moreover, it is able to scale up and scale back according to the changes of data size and cluster scale, and isolate the job of update and retrieval in a limited scope. To eliminate the risk of false negative and to ensure our index "look like consistent", two rules are given to specify the behavior of index update and data retrieval. Experimental results demonstrate that our solution not only outperforms the state of the art, but also is flexible enough to adapt to the cloud environment. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Cheng, X., Li, H., Wang, Y., Wang, T., & Yang, D. (2014). BF-Matrix: A secondary index for the cloud storage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8485 LNCS, pp. 384–396). Springer Verlag. https://doi.org/10.1007/978-3-319-08010-9_40

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