政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69382

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 109948/140897 (78%)
造访人次 : 46092519 在线人数 : 1153

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/69382

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/69382

题名:	A New Relation Partitioning Scheme for Distributed Query Optimization
作者:	陳良弼 Wang,Wen-Fang;Chen,Arbee L. P.
贡献者:	資科系
关键词:	distributed database system;query optimization;relation partition;relation replication;hash function;heterogeneous database system
日期:	1996-03
上传时间:	2014-08-28 10:15:01 (UTC+8)
摘要:	The "fragment and replicate" strategy has been used to process distributed queries. One of the relations referenced in a query is horizontally partitioned into fragments and distributed to a set of processing sites. After other relations are replicated at these sites, the query is processed in parallel. The query answer is the union of the results produced at each processing site. To process a query, we have to determine which relation to partition, how to partition this relation, and which sites will be the processing sites. In this paper, we extend this strategy by considering replication of portions of the relations instead of the entire relations to improve system performance. Based on the characteristics of semijoin, the min-max method and a hash-based method are designed to partition relations. A general algorithm based on these new processing methods is then given, which determines the relations to partition, the manner of partitioning, and the sites to use to process the query. Further, since the replicated relations may be useful for future queries, we will descuss the way to manage them. Finally, we will show how the algorithm can be used in a heterogeneous database system.
關聯:	Journal of Inforamtion Science and Engineering,12(1),79-99
数据类型:	article
显示于类别:	[資訊科學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML2	1123	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

数据加载中.....