3368 search results - page 282 / 674 » The Complexity of Query Reliability |
197
click to vote
FOCS
1998
IEEE
15 years 11 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 ...
160
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
159
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
165
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...
270
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...