119 search results - page 7 / 24 » Benchmarking Query Execution Robustness |
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
ISMIR
2004
Springer
14 years 3 months ago
2004
Springer
In the interest of establishing robust benchmarks for search efficiency, we conducted a series of tests on symbolic databases of musical incipits and themes taken from several di...
DSN
2007
IEEE
14 years 4 months ago
2007
IEEE
Web-services are supported by a complex software infrastructure that must provide a robust service to the client applications. This practical experience report presents a practica...
VLDB
1995
ACM
14 years 1 months ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
ACL
2006
13 years 11 months ago
2006
We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, inclu...