Exploiting the Power of Relational Databases for Efficient Stream

Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a dif-ferent philosophy than nowadays database engines in order to cope with the stream applications requirements. How-ever, this means that they lack the power and sophisticated techniques of a full fledged database system that exploits techniques and algorithms accumulated over many years of database research. In this paper, we take the opposite route and design a stream engine directly on top of a database kernel. Incom-ing tuples are directly stored upon arrival in a new kind of system tables, called baskets. A continuous query can then be evaluated over its relevant baskets as a typical one-tim