首页 | 本学科首页   官方微博 | 高级检索  
     

基于统计的无阻塞连接算法
引用本文:陈刚,顾进广,李思川.基于统计的无阻塞连接算法[J].计算机科学,2010,37(12):143-144.
作者姓名:陈刚  顾进广  李思川
作者单位:武汉科技大学计算机学院,武汉,430065
基金项目:本文受国家自然科学基金(No. 60803160)资助.
摘    要:数据流上的关系查询处理技术是数据库研究领域的一大热点。优化无阻塞连接算法的关键在于提高内存连接阶段的效率。当内存空间满时,需要将内存数据刷新到外存相应分区,良好的刷新策略对于改进算法的性能至关重要。利用数据分布的特征,对关系连接的输出流,使用基于统计的方法,查找使用频率最低的元组,将使用频率较低的元组刷新到外存,以提高内存数据的效率。基于统计分析策略提高了刷新策略的准确性和效率及算法的适用范围。

关 键 词:数据流,无阻塞连接,内存刷新策略

Non-blocking Join Algorithm Based on Statistics
CHEN Gang,GU Jin-guang,LI Si-chuan.Non-blocking Join Algorithm Based on Statistics[J].Computer Science,2010,37(12):143-144.
Authors:CHEN Gang  GU Jin-guang  LI Si-chuan
Affiliation:(School of Computer Science and Tethnology, Wuan University of Science and Tethnology, Wuhan 430065,China)
Abstract:Data stream query processing technology becomes a new and popular topic in database research area.The critical of improving non-blocking join algorithm is to improve the efficiency of memory join stage. If there are no more space for the coming tuple, some old tuples have to be flushed from memory to disk. A good refresh strategy is very helpful to increase join algorithm performance. The lowest frequently used tuples are searched from the result streams, then flush such tuples from memory to disk so that the tuples that arc stayed in the memory would generate more results. Statistics join algorithm performance is increased obviously and it expands the adaptability of the data stream relation join algorithm.
Keywords:Data stream  Non-blocking join  Memory flush strategy
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号