Sketch-based Querying of Distributed Sliding-Window Data Streams

While traditional data-management systems focus on evaluating single, ad-hoc queries over static data sets in a centralized setting, several emerging applications require (possibly, continuous) answers to queries on dynamic data that is widely distributed and constantly updated. Furthermore, such query answers often need to discount data that is "Stale", and operate solely on a sliding window of recent data arrivals (e.g., data updates occurring over the last 24 hours). Such distributed data streaming applications mandate novel algorithmic solutions that are both time- and space-efficient (to manage high-speed data streams), and also communication-efficient (to deal with physical data distribution). In this paper, the authors consider the problem of complex query answering over distributed, high-dimensional data streams in the sliding-window model.

Provided by: VLD Digital Topic: Data Management Date Added: Aug 2012 Format: PDF

Find By Topic