Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficiency of indexing database systems and optimising its implementation in NAND flash memory

Efficiency of indexing database systems and optimising its implementation in NAND flash memory In this paper, we propose a model of optimisation of B+tree index in flash memory. Since the advent of multi-core computers (multi-processors) parallelism becomes an indispensable part of optimisation. Our work will focus on partitioning a table on three parts following indexing key partitioning; each processor will host a partition of the index, and the first processor that will finish its work will immediately take the first partition of the index pending according to the priority, we will implement these manipulations in flash memories storage systems. In this paper, we propose a new alterative to optimise the trade-off between B*tree or B+tree with flash memory software and avoid the data incompatibility due to crash system. Keywords: indexing; tuning; flash memory; optimisation; B*tree. Reference to this paper should be made as follows: Chakraoui, M. and Elkalay, A. (2016) ` in NAND flash memory', Int. J. Systems, Control and Communications, Vol. 7, No. 3, pp.221­239. Biographical notes: Mohamed Chakraoui is a PhD candidate in the Faculty of Sciences and Technics of Marrakesh, Cadi Ayyad University in Morocco. He is also an Engineer in Computer Science in the Poly disciplinary Faculty of Ouarzazate, Ibn Zohr University and he is actually the http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Systems, Control and Communications Inderscience Publishers

Efficiency of indexing database systems and optimising its implementation in NAND flash memory

Download PDF
19 pages

Loading next page...
 
/lp/inderscience-publishers/efficiency-of-indexing-database-systems-and-optimising-its-q5GQRjp0mB

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © 2016 Inderscience Enterprises Ltd.
ISSN
1755-9340
eISSN
1755-9359
DOI
10.1504/IJSCC.2016.077406
Publisher site
See Article on Publisher Site

Abstract

In this paper, we propose a model of optimisation of B+tree index in flash memory. Since the advent of multi-core computers (multi-processors) parallelism becomes an indispensable part of optimisation. Our work will focus on partitioning a table on three parts following indexing key partitioning; each processor will host a partition of the index, and the first processor that will finish its work will immediately take the first partition of the index pending according to the priority, we will implement these manipulations in flash memories storage systems. In this paper, we propose a new alterative to optimise the trade-off between B*tree or B+tree with flash memory software and avoid the data incompatibility due to crash system. Keywords: indexing; tuning; flash memory; optimisation; B*tree. Reference to this paper should be made as follows: Chakraoui, M. and Elkalay, A. (2016) ` in NAND flash memory', Int. J. Systems, Control and Communications, Vol. 7, No. 3, pp.221­239. Biographical notes: Mohamed Chakraoui is a PhD candidate in the Faculty of Sciences and Technics of Marrakesh, Cadi Ayyad University in Morocco. He is also an Engineer in Computer Science in the Poly disciplinary Faculty of Ouarzazate, Ibn Zohr University and he is actually the

Journal

International Journal of Systems, Control and Communications – Inderscience Publishers

Published: Jan 1, 2016

There are no references for this article.