A Novel Fuzzy Approach To Improve Near Neighborhood Allocation Algorithm In Ddb

2009 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2(2009)

引用 7|浏览4
暂无评分
摘要
Since accurate migrations of data fragments in distributed database systems, known dynamic fragment allocation, play an important role in amendment of distributed database performance, several algorithms each of which shows different performance in various conditions, have been proposed to improve dynamic fragment allocation in distributed database systems. In this paper we are going to propose a novel algorithm which is able to detect oscillation conditions and provides a solution to prevent redundant fragment migration. Proposed algorithm, air improved version of the previous Near Neighborhood Allocation (NNA) algorithm, uses a fuzzy inference engine to detect oscillations in fragment request and ignore fragment migrations under these conditions. Our results indicate that, fuzzy based clearly improved the performance of distributed database 'systems in which oscillation conditions are more probable. This algorithm, providing data clustering, is very suitable for DDBS in the networks, with heavy loads, and frequent requests for data fragments coining from different sites.
更多
查看译文
关键词
distributed databases,oscillations,distributed algorithms,resource management,dynamic scheduling,data clustering,distributed database,data engineering,algorithm design and analysis,database systems,clustering algorithms,fuzzy systems,oscillators,fuzzy control,redundancy,artificial neural networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要