Open Access
An Optimization Method for Multiple Persistency Requirements on Stream Management System
Shinichi Yamada,Yousuke Watanabe,Hiroyuki Kitagawa,Toshiyuki Amagasa +3 more
- 01 Jan 2007
TL;DR: The main idea of the optimization is to reduce the writing costs of DBMSs by sharing common store-operators and creates feasible processing plans for multiple persistency requirements.
read more
Abstract: Today, the amount of data delivered as data streams has been increasing, and requirements over data streams have a great variety. We have been developing a stream management system called Harmonica by combining a stream processing engine and DBMSs to fulfill such requirements. Generally, throughputs of DBMSs are slower than those of stream processing engines with a high-speed memory. It is very difficult to process a huge number of continuous queries which request the system to store data into DBMSs. In order to overcome this bottleneck, we propose an optimization method for multiple persistency requirements. The main idea of our optimization is to reduce the writing costs of DBMSs by sharing common store-operators. Our optimization method creates feasible processing plans. In this paper, we present the algorithm of our method and the results of experiment by using Harmonica System.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Stream data control server, stream data control method, and stream data controlling program
Nobutatsu Nakamura,Koji Kida,Kenichiro Fujiyama +2 more
- 03 Sep 2008
TL;DR: In this article, a stream data control server includes a processable flow rate managing unit, which manages a data flow rate corresponding to an amount of data processed per unit time for each class of data to which a data priority is attached.
7
Efficient Invocation of Transaction Sequences Triggered by Data Streams
Masafumi Oyamada,Hideyuki Kawashima,Hiroyuki Kitagawa +2 more
- 26 Oct 2011
TL;DR: This paper model invocation of transaction sequences and propose three schemes named Synchronous Transaction Sequence Invocation (STSI), Asynchronous Transaction SequenceInvocation (ATSI) and Order-Preserving Asynchronous Transactions Sequence Invoke (OPATSI).
References
Aurora: a new model and architecture for data stream management
Daniel J. Abadi,Don Carney,Uğur Çetintemel,Mitch Cherniack,Christian Convey,Sangdon Lee,Michael Stonebraker,Nesime Tatbul,Stan Zdonik +8 more
- 01 Aug 2003
TL;DR: The basic processing model and architecture of Aurora, a new system to manage data streams for monitoring applications, are described and a stream-oriented set of operators are described.
•Proceedings Article
TelegraphCQ: Continuous Dataflow Processing for an Uncertain World.
Sirish Chandrasekaran,Owen Cooper,Amol Deshpande,Michael J. Franklin,Joseph M. Hellerstein,Wei Hong,Sailesh Krishnamurthy,Samuel Madden,Vijayshankar Raman,Frederick Reiss,Mehul A. Shah +10 more
- 01 Jan 2003
TL;DR: The next generation Telegraph system, called TelegraphCQ, is focused on meeting the challenges that arise in handling large streams of continuous queries over high-volume, highly-variable data streams and leverages the PostgreSQL open source code base.
1.2K
Query Processing, Resource Management, and Approximation ina Data Stream Management System
Rajeev Motwani,Jennifer Widom,Arvind Arasu,Brian Babcock,Shivnath Babu,Mayur Datar,Gurmeet Singh Manku,Christopher Olston,Justin Rosenstein,Rohit Varma +9 more
- 01 Jan 2002
TL;DR: This paper describes the ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams that supports a declarative query language.
Materialized view selection and maintenance using multi-query optimization
Hoshi Mistry,Prasan Roy,Sundararajarao Sudarshan,Krithi Ramamritham +3 more
- 01 May 2001
TL;DR: This paper shows how to find an efficient plan for the maintenance of a set of materialized views, by exploiting common subexpressions between different view maintenance expressions, and develops a framework that cleanly integrates the various choices in a systematic and efficient manner.
218
Static optimization of conjunctive queries with sliding windows over infinite streams
Ahmed M. Ayad,Jeffrey F. Naughton +1 more
- 13 Jun 2004
TL;DR: A framework for static optimization of sliding window conjunctive queries over infinite streams is defined and an approach to optimization that unifies the placement of drop boxes and the choice of the query plan from which to drop tuples is investigated.