|
|
|
@inproceedings{DBLP:conf/cikm/OzcanNKED96,
author = {Fatma Ozcan and
Sena Nural and
Pinar Koksal and
Cem Evrendilek and
Asuman Dogac},
title = {Dynamic Query Optimization on a Distributed Object Management
Platform},
booktitle = {CIKM '96, Proceedings of the Fifth International Conference on
Information and Knowledge Management, November 12 - 16, 1996,
Rockville, Maryland, USA},
publisher = {ACM},
year = {1996},
pages = {117-124},
ee = {db/conf/cikm/OzcanNKED96.html, http://doi.acm.org/10.1145/238355.238460},
crossref = {DBLP:conf/cikm/96},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
A Distributed Object Management (DOM) architecture, when used as the infrastructure of a multidatabase system, not only enables easy and flexible interoperation of DBMSs, but also facilitates interoperation of the multidatabase system with other repositories that do not have DBMS capabilities. This is an important advantage, since most of data still resides on repositories that do not have DBMS capabilities.
In this paper, we describe a dynamic query optimization technique for a multidatabase system, namely MIND, implemented on a DOM environment. Dynamic query optimization, which schedules intersite operations at run-time, fits better to such an environment since it benefits from location transparency provided by the DOM framework. In this way, the dynamic changes in the configuration of system resources such as a relocated DBMS or a new mirror to an existing DBMS, do not affect the optimized query execution in the system. Furthermore, the uncertainty in estimating the appearance times (i.e., the execution time of the global sub-query at a local DBMS) of partial results are avoided because there is no need for the dynamic optimizer to know the logical cost parameters of the underlying local DBMS.
In scheduling the intersite operations a statistical decision mechanism is used. We also consider the schema integration information to make room for further query optimization. For this purpose, a method is presented that forms global query graphs by taking the schema integration information into account which is then used by the dynamic query optimizer. The proposed scheme tries to exploit the inherent parallelism in the system as much as possible.
The performance of the developed method is compared with two other most related techniques and the results of the experiments indicate that the dynamic query optimization technique presented in this paper has a better performance.
Copyright © 1996 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.