Sciweavers

274 search results - page 11 / 55
» On Random Sampling over Joins
Sort
View
SIGMOD
2010
ACM
174views Database» more  SIGMOD 2010»
15 years 6 months ago
Sampling dirty data for matching attributes
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
Henning Köhler, Xiaofang Zhou, Shazia Wasim S...
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
16 years 1 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 1 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
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 amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
98
Voted
DKE
2006
67views more  DKE 2006»
15 years 1 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
P2P
2009
IEEE
126views Communications» more  P2P 2009»
15 years 8 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...