检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用》2009年第11期3084-3087,共4页journal of Computer Applications
基 金:北京市属市管高等学校人才强教计划资助项目
摘 要:为了提高查询效率,从数据流查询过程中查询操作单元和查询存储结构的共享两个方面展开研究。设计一种基于共享的二级索引队列,用于存储数据流中间结果。该结构使得中间查询结果可以再利用的同时也为数据共享情况下的迁移提供了一定的灵活性。对于多查询共享,通过抽取相同数据流中的相同谓词进行查询共享,实现一处计算多处使用的目的。最后对相关模型和算法进行了分析。Query sharing is an effective way to share the same or similar storage structures and query operations during the query procession so as to lessen the repetitive storage and resources occupation in a data stream system. For query storage sharing, a middle-result storage structure was designed, and accordingly an index-based algorithm with two-level indirect storage of the sharing queue was presented to enable the proper sharing of middle storage results, which can improve the flexibility for the data tuple to migrate as well. Meanwhile, for the multi-queries sharing, an algorithm to pick up the same query operations from several data streams was proposed, which can reduce the system processing resources by sharing the same processing resources in query operations. The model and algorithm were analyzed and discussed.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117