223 search results - page 8 / 45 » Approximate Frequency Counts over Data Streams |
75
Voted
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
110
click to vote
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
IDEAS
2008
IEEE
15 years 4 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
166
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...