32 search results - page 4 / 7 » Finding Frequent Items over General Update Streams |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...