Table of Content

Open Access iconOpen Access

ARTICLE

SI Bitmap Index and Optimization for Membership Query

by

a School of Computer Science,Wuhan University of Technology, Wuhan, 430063, China;
b Hubei Key Laboratory of Transportation Internet of Things, Wuhan University of Technology, Wuhan, 430063, China.

* Corresponding Author: Shu Gao email

Intelligent Automation & Soft Computing 2019, 25(4), 683-689. https://doi.org/10.31209/2018.100000061

Abstract

The explosive growth of data produced by internet of things has contributed to the abundance of data. Since then, efficient indexing and querying techniques for data retrieval has become a major challenge. Bitmap index and its extension techniques, which involve a bit sequence that represents a specified property and indicates the data items that satisfies this property, are well-known methods to improve processing time for complex and interactive queries on the read-mostly or append-only data. This paper proposes an improved bitmap index technique, named Sliced-Interval Bitmap Index (SI Bitmap Index), which is efficient in both space and response time for Membership query. It also describes the method to optimize Membership query, based on SI Bitmap Index, in four steps. Experimental results indicate that SI Bitmap Index is space-saving as well as high efficiency on Membership query.

Keywords


Cite This Article

APA Style
Gao, S., Wang, Z., Chen, L. (2019). SI bitmap index and optimization for membership query. Intelligent Automation & Soft Computing, 25(4), 683-689. https://doi.org/10.31209/2018.100000061
Vancouver Style
Gao S, Wang Z, Chen L. SI bitmap index and optimization for membership query. Intell Automat Soft Comput . 2019;25(4):683-689 https://doi.org/10.31209/2018.100000061
IEEE Style
S. Gao, Z. Wang, and L. Chen, “SI Bitmap Index and Optimization for Membership Query,” Intell. Automat. Soft Comput. , vol. 25, no. 4, pp. 683-689, 2019. https://doi.org/10.31209/2018.100000061



cc Copyright © 2019 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1339

    View

  • 1173

    Download

  • 0

    Like

Related articles

Share Link