Sciweavers

2228 search results - page 363 / 446
» On Database Theory and XML
Sort
View
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 10 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 7 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas