TUNING DIFFERENT TYPES OF COMPLEX QUERIES USING THE APPROPRIATE INDEXES IN PARALLEL/DISTRIBUTED DATABASE SYSTEMS

Authors

  • Mohamed Chakraoui
  • Abderrafiaa El Kalay
  • Naoual Mouhni

Keywords:

parallelization, sub-query, optimization, interference between indexes, b*tree, bitmap, local index, data partitioning

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.

Downloads

Published

2017-04-12

How to Cite

Mohamed Chakraoui, Abderrafiaa El Kalay, & Naoual Mouhni. (2017). TUNING DIFFERENT TYPES OF COMPLEX QUERIES USING THE APPROPRIATE INDEXES IN PARALLEL/DISTRIBUTED DATABASE SYSTEMS. GEOMATE Journal, 11(24), 2267–2274. Retrieved from https://geomatejournal.com/geomate/article/view/2063

Similar Articles

You may also start an advanced similarity search for this article.