Sciweavers

780 search results - page 144 / 156
» Cost-Sharing Approximations for h
Sort
View
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 13 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 13 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
14 years 5 days ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
14 years 5 days ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 5 days ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi