Efficiency of indexing database systems and optimising its implementation in NAND flash memory
by Mohamed Chakraoui; Abderrafiaa Elkalay
International Journal of Systems, Control and Communications (IJSCC), Vol. 7, No. 3, 2016

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.

Online publication date: Wed, 29-Jun-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com