2514 search results - page 274 / 503 » On the Computation of Approximations of Database Queries |
173
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
171
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
267
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
182
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
170
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed...