By Topic

Ad Hoc Aggregation Query Processing Algorithms Based on Bit-Store in Data Intensive Cloud

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Donghua Yang ; Acad. of Fundamental & Interdiscipl. Sci., Harbin Inst. of Technol., Harbin, China ; Jianzhong Li ; Xixian Han ; Jinbao Wang

Ad-hoc Aggregation query is extremely important for data-intensive applications in the cloud which extracts valuable summary information on massive datasets to help decision-maker make right decisions. Current data storage schemes (row-store and column-store) cannot efficiently answer ad-hoc aggregation on massive data sets in the cloud. A new data storage structure (bit vector storage structure, bit-store for short) is proposed in the paper, which partitions tables vertically by bit position and stores all bit values in the same positions into a separate bit file. This paper focuses on proposing ad-hoc aggregation query algorithms based on bit-store. Firstly, the storage model of bit-store including its attribute encoding and bit file organization is introduced. Then, the implementation of different aggregation operations using different encoding schemes is presented. Finally, analytical and experimental results show the effectiveness and efficiency of the proposed approach.

Published in:

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2011 International Conference on

Date of Conference:

10-12 Oct. 2011