2223 search results - page 94 / 445 » Query Optimization in an OODBMS |
BTW
2005
Springer
15 years 5 months ago
2005
Springer
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
123
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
104
click to vote
WWW
2006
ACM
16 years 16 days ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
177
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
126
click to vote
EDBTW
2006
Springer
15 years 3 months ago
2006
Springer
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...