Broadcast program generation for unordered queries with data replication

Jiun-Long Huang*, Ming Syan Chen

*此作品的通信作者

研究成果: Paper同行評審

29 引文 斯高帕斯(Scopus)

摘要

We study in this paper the problem of broadcasting dependent data for unordered queries. However, most prior studies on dependent data broadcasting are limited to the premise of no data replication. Different from other prior studies, we investigate the effect of data replication in this paper. Specifically, we first derive several theoretical properties for the average access time by analyzing the model of dependent data broadcasting. On the basis of the theoretical results, we develop a genetic algorithm to generate broadcast programs with replication. In order to compare the performance of the proposed algorithm and the prior studies, several experiments are conducted. Our experimental results show that with the analytical results derived, the theoretical results derived are able to guide the search of the genetic algorithm very effectively, and lead to solution broadcast programs of higher quality than those of the prior studies.

原文English
頁面866-870
頁數5
DOIs
出版狀態Published - 18 7月 2003
事件Proceedings of the 2003 ACM Symposium on Applied Computing - Melbourne, FL, United States
持續時間: 9 3月 200312 3月 2003

Conference

ConferenceProceedings of the 2003 ACM Symposium on Applied Computing
國家/地區United States
城市Melbourne, FL
期間9/03/0312/03/03

指紋

深入研究「Broadcast program generation for unordered queries with data replication」主題。共同形成了獨特的指紋。

引用此