期刊文献+

一种数据流查询共享模型的设计

Query sharing model in data stream system
下载PDF
导出
摘要 为了提高查询效率,从数据流查询过程中查询操作单元和查询存储结构的共享两个方面展开研究。设计一种基于共享的二级索引队列,用于存储数据流中间结果。该结构使得中间查询结果可以再利用的同时也为数据共享情况下的迁移提供了一定的灵活性。对于多查询共享,通过抽取相同数据流中的相同谓词进行查询共享,实现一处计算多处使用的目的。最后对相关模型和算法进行了分析。 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.
作者 王丹 李茂增
出处 《计算机应用》 CSCD 北大核心 2009年第11期3084-3087,共4页 journal of Computer Applications
基金 北京市属市管高等学校人才强教计划资助项目
关键词 查询优化 CQL语言 查询树 query optimization CQL language query tree
  • 相关文献

参考文献11

  • 1金澈清,钱卫宁,周傲英.流数据分析与管理综述[J].软件学报,2004,15(8):1172-1181. 被引量:161
  • 2ARASU A, BABU S, WIDOM J. An abstract semantics and concrete language for continuous queries over streams and relations [ EB/ OL]. [ 2009 - 03 - 25 ]. http://journals, iranscience, net: 800/ www. jgaa. info/www, cs. brown, edu/courses/cs227/papers/ ABW02 -AbstractSemanties. pdf.
  • 3王伟平,李建中,张冬冬,郭龙江.数据流上周期更新滑动窗口的连接算法[J].哈尔滨工业大学学报,2005,37(6):756-759. 被引量:6
  • 4MOTWANI R, WIDOM J, ARASU A, et al. Query processing, resource management, and approximation in a data stream management system [EB/OL]. [2009 - 03 - 26]. http://www-db, cs. wise. edu/cidr/cidr2003/program/p22, pdf.
  • 5BABCOCK B, BABUY S, DATAR M, et al. Operator scheduling in data stream systems [ EB/OL]. [ 2009 -03 -24]. http://www, cs. virginia, edu/- son/cs851/stream/papers/showDoc2, pdf.
  • 6GOLAB L, OZSU M T. Issues in data stream management [ J]. ACM SIGMOD Record, 2003, 32(2): 5-14.
  • 7MAIER D, TUCKER P A, GAROFALAKIS M. Stream data management [ M]. Berlin: Springer-Verlag, 2005.
  • 8CORMODE G, MUTHUKRISHNAN S. What's new: Finding significant differences in network data streams [ EB/OL]. [ 2009 - 03 - 25]. http://www, cs. rutgers, edu/- muthu/676879419, pdf.
  • 9The STREAM Group. STREAM: The stanford stream data manager [ EB/OL]. [ 2009 - 03 - 25]. http://ilpubs, stanford, edu: 8090/ 583/1/2003-21. pdf.
  • 10CARNEY D, CETINTEMEL U, CHERNIACK M, et al. Monitoring streams: A new class of data management applications [ C]// Proceedings of the 28th International Conference on Very Large Data Bases. [ S. l. ] : VLDB Endowment, 2002:215 -226.

二级参考文献57

  • 1Babcock B, Babu S, Datar M, Motwani R, Widom J. Models and issues in data streams. In: Popa L, ed. Proc. of the 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems. Madison: ACM Press, 2002. 1~16.
  • 2Terry D, Goldberg D, Nichols D, Oki B. Continuous queries over append-only databases. SIGMOD Record, 1992,21(2):321-330.
  • 3Avnur R, Hellerstein J. Eddies: Continuously adaptive query processing. In: Chen W, Naughton JF, Bernstein PA, eds. Proc. of the 2000 ACM SIGMOD Int'l Conf. on Management of Data. Dallas: ACM Press, 2000. 261~272.
  • 4Hellerstein J, Franklin M, Chandrasekaran S, Deshpande A, Hildrum K, Madden S, Raman V, Shah MA. Adaptive query processing: Technology in evolution. IEEE Data Engineering Bulletin, 2000,23(2):7-18.
  • 5Carney D, Cetinternel U, Cherniack M, Convey C, Lee S, Seidman G, Stonebraker M, Tatbul N, Zdonik S. Monitoring streams?A new class of DBMS applications. Technical Report, CS-02-01, Providence: Department of Computer Science, Brown University, 2002.
  • 6Guha S, Mishra N, Motwani R, O'Callaghan L. Clustering data streams. In: Blum A, ed. The 41st Annual Symp. on Foundations of Computer Science, FOCS 2000. Redondo Beach: IEEE Computer Society, 2000. 359-366.
  • 7Domingos P, Hulten G. Mining high-speed data streams. In: Ramakrishnan R, Stolfo S, Pregibon D, eds. Proc. of the 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. Boston: ACM Press, 2000. 71-80.
  • 8Domingos P, Hulten G, Spencer L. Mining time-changing data streams. In: Provost F, Srikant R, eds. Proc. of the 7th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining. San Francisco: ACM Press, 2001. 97~106.
  • 9Zhou A, Cai Z, Wei L, Qian W. M-Kernel merging: Towards density estimation over data streams. In: Cha SK, Yoshikawa M, eds. The 8th Int'l Conf. on Database Systems for Advanced Applications (DASFAA 2003). Kyoto: IEEE Computer Society, 2003. 285~292.
  • 10Gibbons PB, Matias Y. Synopsis data structures for massive data sets. In: Tarjan RE, Warnow T, eds. Proc. of the 10th Annual ACM-SIAM Symp. on Discrete Algorithms. Baltimore: ACM/SIAM, 1999. 909-910.

共引文献164

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部