390 search results - page 30 / 78 » Approximate Query Answering in Locally Closed Databases |
134
click to vote
SIGMOD
2010
ACM
15 years 8 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...
155
Voted
TODS
2002
15 years 3 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
114
Voted
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
An increasing amount of data is produced in the form of text streams − these can be RSS news feeds, TV closed captions, emails, etc. We study the problem of answering keyword qu...
128
click to vote
CCCG
2010
15 years 5 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
133
click to vote
DEBU
2010
15 years 4 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...