A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
This paper proposes a strategy for parallel composite event detection in Active database systems (DBS). Up to now, the detection is sequential and totally synchronized, and thus p...
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...