Fragment Allocation in Distributed Database Design

Fragment Allocation in Distributed Database Design (2001)

by Yin-fu Huang , Jyh-her Chen

Venue:	Journal of Information Science and Engineering
Citations:	8 - 0 self

Datum	Value	Source
TITLE	Fragment Allocation in Distributed Database Design	SVM HeaderParse 0.2
AUTHOR NAME	Yin-fu Huang	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute of Electronics and Information Engineering; National Yunlin University of Science and Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Yunlin, Taiwan 640, R.O.C.	SVM HeaderParse 0.2
AUTHOR NAME	Jyh-her Chen	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute of Electronics and Information Engineering; National Yunlin University of Science and Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Yunlin, Taiwan 640, R.O.C.	SVM HeaderParse 0.2
ABSTRACT	On a Wide Area Network (WAN), fragment allocation is a major issue in distributed database design since it concerns the overall performance of distributed database systems. Here we propose a simple and comprehensive model that reflects transaction behavior in distributed databases. Based on the model and transaction information, two heuristic algorithms are developed to find a near-optimal allocation such that the total communication cost is minimized as much as possible. The results show that the fragment allocation found by the algorithms is close to being an optimal one. Some experiments were also conducted to verify that the cost formulas can truly reflect the communication cost in the real world.	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE	Journal of Information Science and Engineering	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	491--506	INFERENCE
VOLUME	17	INFERENCE
CITATIONS	18 found	ParsCit 1.0