Optimization of continuous queries in federated database and stream processing systems
dc.contributor.author | Ji, Yuanzhen | |
dc.contributor.author | Jerzak, Zbigniew | |
dc.contributor.author | Nica, Anisoara | |
dc.contributor.author | Hackenbroich, Gregor | |
dc.contributor.author | Fetzer, Christof | |
dc.contributor.editor | Seidl, Thomas | |
dc.contributor.editor | Ritter, Norbert | |
dc.contributor.editor | Schöning, Harald | |
dc.contributor.editor | Sattler, Kai-Uwe | |
dc.contributor.editor | Härder, Theo | |
dc.contributor.editor | Friedrich, Steffen | |
dc.contributor.editor | Wingerath, Wolfram | |
dc.date.accessioned | 2017-06-30T11:40:46Z | |
dc.date.available | 2017-06-30T11:40:46Z | |
dc.date.issued | 2015 | |
dc.description.abstract | The constantly increasing number of connected devices and sensors results in increasing volume and velocity of sensor-based streaming data. Traditional approaches for processing high velocity sensor data rely on stream processing engines. However, the increasing complexity of continuous queries executed on top of high velocity data has resulted in growing demand for federated systems composed of data stream processing engines and database engines. One of major challenges for such systems is to devise the optimal query execution plan to maximize the throughput of continuous queries. In this paper we present a general framework for federated database and stream processing systems, and introduce the design and implementation of a cost-based optimizer for optimizing relational continuous queries in such systems. Our optimizer uses characteristics of continuous queries and source data streams to devise an optimal placement for each operator of a continuous query. This fine level of optimization, combined with the estimation of the feasibility of query plans, allows our optimizer to devise query plans which result in 8 times higher throughput as compared to the baseline approach which uses only stream processing engines. Moreover, our experimental results showed that even for simple queries, a hybrid execution plan can result in 4 times and 1.6 times higher throughput than a pure stream processing engine plan and a pure database engine plan, respectively. | en |
dc.identifier.isbn | 978-3-88579-635-0 | |
dc.identifier.pissn | 1617-5468 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | Datenbanksysteme für Business, Technologie und Web (BTW 2015) | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-241 | |
dc.title | Optimization of continuous queries in federated database and stream processing systems | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 422 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 403 | |
gi.conference.date | 2.-3. März 2015 | |
gi.conference.location | Hamburg |
Dateien
Originalbündel
1 - 1 von 1