55 search results - page 6 / 11 » Randomized Synopses for Query Assurance on Data Streams |
PODS
2006
ACM
14 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
PAKDD
2004
ACM
14 years 1 days ago
2004
ACM
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
SSD
2005
Springer
14 years 5 days ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...