Optimization Query Process of Mediators Interrogation Based On Combinatorial Storage

In the distributed environment where a query involves several heterogeneous sources, communication costs must be taken into consideration. In this paper we describe a query optimization approach using dynamic programming technique for set integrated heterogeneous sources. The objective of the optimization is to minimize the total processing time including load processing, request rewriting and communication costs, to facilitate communication inter-sites and to optimize the time of data transfer from site to others. Moreover, the ability to store data in more than one centre site provides more flexibility in terms of Security/Safety and overload of the network. In contrast to optimizers which are considered a restricted search space, the proposed optimizer searches the closed subsets of sources and independency relationship which may be deep laniary or hierarchical trees. Especially the execution of the queries can start traversal anywhere over any subset and not only from a specific source.

@article{Cherrat2013,
  title     = {Optimization Query Process of Mediators Interrogation Based On Combinatorial Storage},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {4},
  number    = {4},
  year      = {2013},
  publisher = {The Science and Information Organization},
  author    = {L. Cherrat and M. Ezziyyani and M. Essaaidi},
  doi       = {10.14569/IJACSA.2013.040418},
  url       = {https://doi.org/10.14569/IJACSA.2013.040418}
}