3368 search results - page 313 / 674 » The Complexity of Query Reliability |
170
click to vote
FQAS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural leve...
255
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Data allocation is a key performance factor for parallel database systems (PDBS). This holds especially for data warehousing environments where huge amounts of data and complex an...
192
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
222
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
176
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...