By Topic

A column-oriented storage query optimization for flash-based database

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

3 Author(s)
Jiulei Jiang ; Sch. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China ; Jiajin Le ; Yan Wang

The existing database systems are designed based on the physical characteristics of the magnetic disks, and they have failed to obviously improve the performance of solid-state disks (SSD). Therefore, a new connection algorithm, namely CSub-Join, is proposed in this paper. It is a query optimization algorithm for flash databases based on a column storage model. The algorithm first reads columns from two joining tables as CSub tables, and then executes joint operations on CSub tables to generate a join index table and a fetch sequence table. Finally, according to the two generated tables, the query results are taken back from the two joining tables by columns. Using the small size of column oriented storage and the high-speed random read of SSD, the algorithm overcomes the speed mismatch between database systems and flash memories. The results of experiments show that CSub-Join algorithm clearly outperforms CSub-Join algorithm under various selectivities and memory sizes.

Published in:

Future Information Technology and Management Engineering (FITME), 2010 International Conference on  (Volume:3 )

Date of Conference:

9-10 Oct. 2010