• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Information Technology: New Generations;ITNG '09 >A Hybrid Reconfiguration Algorithm for Fast Continuous Query Processing
【24h】

A Hybrid Reconfiguration Algorithm for Fast Continuous Query Processing

机译：快速连续查询处理的混合重构算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With increasing hardware capabilities and network capacity, applications operating on streams of data are becoming more prevalent in the computing industry. Used in areas from security such as packet-sniffing intrusion detection software packages to the financial world attempting to model the stock market to map out future trends, algorithms for processing these unbounded streams are growing in necessity. Traditional database management systems fall short, as they are limited to bounded data. Therefore, stream management systems are required, as well as algorithms to efficiently process these data streams. Furthermore, these algorithms must be agile, adaptive and suitable for a wide range of operating conditions. In this paper, we design a hybrid algorithm to find optimized join trees for continuous stream queries. Our experimental results show that this hybrid algorithm can generate more efficient join trees than its components under a wide range of varied conditions.
机译：随着硬件功能和网络容量的增加，在数据流上运行的应用程序在计算行业中变得越来越普遍。从安全性（例如包嗅探入侵检测软件包）到试图建模股票市场以描绘未来趋势的金融领域中使用的算法，处理这些无限制流的算法的需求在不断增长。传统的数据库管理系统不足，因为它们仅限于有限的数据。因此，需要流管理系统以及有效处理这些数据流的算法。此外，这些算法必须灵活，自适应并且适用于广泛的工作条件。在本文中，我们设计了一种混合算法，以找到用于连续流查询的优化联接树。我们的实验结果表明，在各种不同条件下，此混合算法比其组件可以生成更有效的连接树。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号