TY - GEN
T1 - Minimization of resource consumption for multidatabase query optimization
AU - Lee, Chiang
AU - Ke, Chih Horng
AU - Chang, Jer Bin
AU - Chen, Yaw Huei
N1 - Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - Due to the autonomy of individual databases, a multidatabase system (MDBS) has no control over the task execution within each database system. This complicates the issue of query optimization in a MDBS. Past researchers tackled this problem mainly by regenerating the cost model of each participating database systems. However a completely autonomous participating database system does nor own the information (data) as well as the mechanism (software) for converting data of one database to another to resolve the data type conflict problems that can occur in any MDBS environment. In addition, unpredictable factors that can drastically deviate the accuracy of a regenerated cost model (in the past research) come into play at unknown time. This confines the processing of an intersite operation (such as a join over two relations of different databases) to the MDBS only. The participating database systems will not be able to share the workload of the MDBS under this circumstance. Hence, minimizing the consumption of system resources of the MDBS is an urgent problem. The authors propose three scheduling algorithms that are used in the MDBS to reduce the processing cost of a multidatabase query. A major difference between the strategies and the past methods is that ours do not require the knowledge of the cost models of the participating databases.
AB - Due to the autonomy of individual databases, a multidatabase system (MDBS) has no control over the task execution within each database system. This complicates the issue of query optimization in a MDBS. Past researchers tackled this problem mainly by regenerating the cost model of each participating database systems. However a completely autonomous participating database system does nor own the information (data) as well as the mechanism (software) for converting data of one database to another to resolve the data type conflict problems that can occur in any MDBS environment. In addition, unpredictable factors that can drastically deviate the accuracy of a regenerated cost model (in the past research) come into play at unknown time. This confines the processing of an intersite operation (such as a join over two relations of different databases) to the MDBS only. The participating database systems will not be able to share the workload of the MDBS under this circumstance. Hence, minimizing the consumption of system resources of the MDBS is an urgent problem. The authors propose three scheduling algorithms that are used in the MDBS to reduce the processing cost of a multidatabase query. A major difference between the strategies and the past methods is that ours do not require the knowledge of the cost models of the participating databases.
UR - http://www.scopus.com/inward/record.url?scp=85049516850&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049516850&partnerID=8YFLogxK
U2 - 10.1109/COOPIS.1998.706202
DO - 10.1109/COOPIS.1998.706202
M3 - Conference contribution
AN - SCOPUS:85049516850
T3 - Proceedings - 3rd IFCIS International Conference on Cooperative Information Systems, CoopIS 1998
SP - 241
EP - 250
BT - Proceedings - 3rd IFCIS International Conference on Cooperative Information Systems, CoopIS 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IFCIS International Conference on Cooperative Information Systems, CoopIS 1998
Y2 - 20 August 1998 through 22 August 1998
ER -