1778 search results - page 258 / 356 » The Theory of Probabilistic Databases |
160
click to vote
TKDE
2012
13 years 6 months ago
2012
—Search engine companies collect the “database of intentions”, the histories of their users’ search queries. These search logs are a gold mine for researchers. Search engin...
158
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
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...
165
Voted
PODS
2007
ACM
16 years 4 months ago
2007
ACM
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...
138
click to vote
SIGMOD
1993
ACM
15 years 8 months ago
1993
ACM
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 ...
258
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
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,...