106 search results - page 8 / 22 » Query Optimization by Predicate Move-Around |
VLDB
2001
ACM
14 years 2 days ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
VLDB
2002
ACM
13 years 7 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
2000
ACM
14 years 16 hour ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
ADBIS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...