Efficiency of indexing database systems and optimising its implementation in NAND flash memory
Mohamed Chakraoui, Abderrafiaa Elkalay · International Journal of Systems Control and Communications · 2016
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.