检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]东软集团有限公司,辽宁沈阳110179
出 处:《东北大学学报(自然科学版)》2005年第11期1048-1051,共4页Journal of Northeastern University(Natural Science)
基 金:国家自然科学基金资助项目(60473073);教育部高等学校优秀青年教师科研奖励计划项目
摘 要:基于如何提高多个聚集查询的查询效率,提出了一种共享链树结构的多查询聚集计算共享策略.利用每个滑动窗口逻辑地将链树划分成若干子树,它们各自根节点中的聚集值恰好就是每个查询对应的结果值.数据流上多个查询可以在同一棵链树上并发执行,避免了每个查询的重复建树.同时,利用链树本身可降低无用的重复比较的性质,使得多个查询在同一棵链树上只需进行少量更新比较就可求得每个查询的新聚集值.实验证明,多个查询共用同一链树结构,可以最大程度地共享资源,减小内存使用量,因此大大提高了数据流上的查询处理效率,加大了数据流上的任务吞吐量,改善了系统性能.How to improve the efficiency of multi-aggregate queries is a key problem, to which a novel linked-tree sharing strategy is proposed to support multi-aggregate queries in sliding window over data streams. In this way, each and every sliding window will divide the linked-tree logically into several sub-trees where the aggregate values of different root nodes are just the answers corresponding to their aggregate queries. This kind of logical division makes several queries run in a tree simultaneously, thus avoiding the repeated construction of different linked-trees. Taking advantage of the characteristic of the linked-tree available to reduce the number of fruitlessly repeated comparisons, the aggregate value of each query can be given with few updates/comparisons to do when many queries are required for answers from the same linked-tree. Extensive experiments showed that sharing the same linked-tree can cause lots of queries to share the resources with memory content decreased accordingly. As a result, the query processing efficiency, throughputs of real time tasks and system's performance are all improved dramatically.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38