1091 search results - page 162 / 219 » Approximation in Databases |
108
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
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...
102
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
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...
116
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
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...
153
click to vote
SSDBM
2010
IEEE
15 years 6 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
124
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...