3368 search results - page 202 / 674 » The Complexity of Query Reliability |
166
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
167
click to vote
ISRR
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
183
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
165
click to vote
DOLAP
1999
ACM
15 years 10 months ago
1999
ACM
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
166
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....