Processing complex aggregate queries over data streams
By Alin Dobra, Minos N. Garofalakis, Johannes Gehrke, Rajeev Rastogi. ACM SIGMOD Conference, 2002
360 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/183603b4fbe3ec3be3efe6aaee58a2567df9b558
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sanjay Krishnan
- Charu C. Aggarwal
- M. Franklin
- Jiannan Wang
- Ken Goldberg
- Graham Cormode
- Tim Kraska
- Jimeng Sun
In Computer Networks and Communications
- Graham Cormode
- S. Muthu Muthukrishnan
- M. Franklin
- Charu C. Aggarwal
- Sanjay Krishnan
- Johannes Gehrke
- Christos Faloutsos
- Jeffrey F. Naughton
In Signal Processing
- M. Franklin
- Graham Cormode
- Sanjay Krishnan
- S. Muthu Muthukrishnan
- Jiannan Wang
- Ken Goldberg
- Tim Kraska
- Johannes Gehrke
Citations in the corpus
- An improved data stream summary: the count-min sketch and its applications (2004, background): “These sketches are of interest not simply because they can be used to directly approximate quantities of interest, but also because they have been used considerably as “black box” devices in order to compute more sophisticated aggregates and complex quantities: quantiles [21], wavelets [20], histogr”
- Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams (2003, neutral): “For instance, Datar et al. [11] give an approximate algorithm for bit counting in a sliding window .”
- Stale View Cleaning: Getting Fresh Answers from Stale Materialized Views (2015, background): “There are a variety of other efforts proposing storage efficient processing of aggregate queries on streams [15,21] which is similar to our problem setting and motivation.”
- Streaming Pattern Discovery in Multiple Time-Series (2005, background): “In addition to system-building efforts, a number of approximation techniques have been studied in the context of streams, such as sampling [7], sketches [16, 10, 19], exponential histograms [13], and wavelets [22].”
- Evaluating window joins over unbounded streams (2003, methodology): “Recently a good deal of research has been conducted in this area: for example, stream sampling [27], updating summary data structures [36][40][37][41][38], and maintaining stream statistics [11].”
- Issues in data stream management (2003, neutral): “Some examples include [1, 15, 20, 26, 29, 33, 37].”
- The CQL continuous query language: semantic foundations and query execution (2006, neutral): “edu [2, 19, 20, 23, 28, 32].”
- Clock synchronization for wireless sensor networks: a survey (2005, background): “In wireless sensor networks, the basic operation is data fusion , whereby data from each sensor is agglomerated to form a single meaningful result [17,44,71,74,76–78].”
- Gossip-based computation of aggregate information (2003, background): “Specifically, we show how to extend the analysis in a relatively straightforward way to answer many kinds of aggregate queries in databases [3, 4, 11, 13, 14, 15, 33], essentially any query that can be approximated well using linear synopses.”
- Efficient decision tree construction on streaming data (2003, background): “More recently, the database community has focused on a new model of data processing, in which data arrives in the form of continuous streams [3, 4, 9, 12, 14, 16, 23, 30].”