arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.4283cs.DB
收藏

复杂事件处理中的减载技术研究

On Load Shedding in Complex Event Processing

Yeye He, Siddharth Barman, Jeffrey F. Naughton

摘要:

复杂事件处理(CEP)是一种流处理模型,专注于检测连续事件流中的事件模式。虽然CEP模型已经在研究社区和商业技术中获得了普及,但是在存在资源约束或减载的情况下在重负载下优雅地降低性能的问题在很大程度上被忽视了。CEP类似于“经典的”流数据管理,但它处理的是完全不同的一类查询。不幸的是,这使得为流数据处理开发的甩负荷算法不适用。在本文中,我们研究CEP切负荷在各种资源约束。我们正式广泛的类CEP切负荷方案作为不同的优化问题。我们展示了一系列的复杂性结果,揭示了这些问题的硬度和构建脱落算法的性能保证。我们的研究结果揭示了开发负荷削减算法,最大限度地提高效用的困难。

英文摘要:

Complex Event Processing (CEP) is a stream processing model that focuses on detecting event patterns in continuous event streams. While the CEP model has gained popularity in the research communities and commercial technologies, the problem of gracefully degrading performance under heavy load in the presence of resource constraints, or load shedding, has been largely overlooked. CEP is similar to "classical" stream data management, but addresses a substantially different class of queries. This unfortunately renders the load shedding algorithms developed for stream data processing inapplicable. In this paper we study CEP load shedding under various resource constraints. We formalize broad classes of CEP load-shedding scenarios as different optimization problems. We demonstrate an array of complexity results that reveal the hardness of these problems and construct shedding algorithms with performance guarantees. Our results shed some light on the difficulty of developing load-shedding algorithms that maximize utility.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑