789 search results - page 51 / 158 » On Theory Revision with Queries |
114
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Data privacy is an important application of ontology modularization. The aim is to publish one module while keeping the information of another module private. We show how...
146
click to vote
SIGMOD
2007
ACM
16 years 19 hour ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
116
click to vote
PODS
2008
ACM
16 years 3 hour ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
SAT
2004
Springer
15 years 5 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...