6274 search results - page 234 / 1255 » From query complexity to computational complexity |
165
click to vote
ICDT
2007
ACM
15 years 11 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
193
Voted
DBISP2P
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
367
click to vote
ICDE
2000
IEEE
16 years 6 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
171
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
226
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...