Tuning different types of complex queries using the appropriate indexes in parallel/distributed database systems

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we discuss the most powerful techniques of tuning parallel/distributed databases. As in engineering, database tuning becomes an inescapable part of big projects since the conception phase of research projects. The needs of companies including big data have increased to databases optimization. Systems that not take into account the optimization rules become heavy after five years of their production; these reasons were of a paramount of importance to prepare this paper. Indexing is the most suitable way to optimize database systems, further one of the top ways of optimizing index is the application of parallelization. In this paper, we will discuss parallelization and we will practice it with different complex queries and sub-queries using different types of indexes; then we will compare the results gotten from each index. To top it all, the most suitable interference between the major types of index: B*Tree index, Bitmap index, composite parallel index, local parallel index and global parallel index.

Cite

CITATION STYLE

APA

Chakraoui, M., El Kalay, A., & Mouhni, N. (2016). Tuning different types of complex queries using the appropriate indexes in parallel/distributed database systems. International Journal of GEOMATE, 11(2), 2267–2274. https://doi.org/10.21660/2016.24.1392

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free