Cost-based Optimization of Multistore Query Plans

Abstract Multistores are data management systems that enable query processing across different and heterogeneous databases; besides the distribution of data, complexity factors like schema heterogeneity replication must be resolved through integration fusion activities. Our multistore solution relies on a dataspace to provide user with an integrated view available enables formulation execution GPSJ queries. In this paper, we propose technique optimize queries by formulating evaluating plans multistore. particular, outline strategies carry out joins relying representations; then, self-learning black-box cost model is used estimate times select most efficient plan. The experiments assess effectiveness in choosing best plan for given exploit multiple benchmarks investigate influence performance plans.