Results 1 -
1 of
1
Processing data-stream join aggregates using skimmed sketches
- In Proc. Int. Conf. on Extending Database Technology (EDBT
, 2004
"... sganguly,minos,rastogiĀ” Abstract. There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amount of memory. Providing (perhaps approximate) answers to aggregate queries over such ..."
Abstract
-
Cited by 23 (4 self)
- Add to MetaCart
. Our skimmed-sketch technique achieves all of the above by first skimming the dense frequencies from random hash-sketch summaries of the two streams. It then computes the subjoin size involving only dense frequencies directly, and uses the skimmed sketches only to approximate subjoin sizes for the non