257 search results - page 29 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
Abstract. 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) ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
SIAMCOMP
2002
14 years 9 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
103
click to vote
KDD
2012
ACM
13 years 2 days ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...