2514 search results - page 209 / 503 » On the Computation of Approximations of Database Queries |
186
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
181
click to vote
ICDCS
2005
IEEE
16 years 7 days ago
2005
IEEE
Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applic...
191
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
310
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
This paper proposes a generic framework for monitoring continuous spatial queries over moving objects. The framework distinguishes itself from existing work by being the first to ...
154
Voted
SAT
2004
Springer
15 years 12 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...