189 search results - page 24 / 38 » Approximating predicates and expressive queries on probabili... |
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
We study the verification of compositions of Web Service peers which interact asynchronously by exchanging messages. Each peer has access to a local database and reacts to user in...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
DEXA
2010
Springer
13 years 9 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...