725 search results - page 42 / 145 » Approximate Join Processing Over Data Streams |
ADC
2010
Springer
13 years 3 months ago
2010
Springer
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative anal...
SSD
2007
Springer
14 years 2 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
TKDE
2008
13 years 8 months ago
2008
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
In order to support continuous queries over data streams, a plethora of suitable techniques as well as prototypes have been developed and evaluated in recent years. In particular,...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...