Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Abstract. Nowadays, we have witnessed the widely recognized phenomenon of high speed data streams. Various statistics computation over data streams is often required by many applic...
Data stream management systems need to control their resources adaptively since stream characteristics and query workload may vary over time. In this paper we investigate an approa...
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
Dirk Kukulenz, Nils Hoeller, Sven Groppe, Volker L...