223 search results - page 6 / 45 » Approximate Frequency Counts over Data Streams |
113
click to vote
PODS
2005
ACM
15 years 9 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
ICEBE
2005
IEEE
15 years 3 months ago
2005
IEEE
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
106
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...