243 search results - page 43 / 49 » Selectivity Estimation for Boolean Queries |
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
AP2PC
2003
Springer
15 years 2 months ago
2003
Springer
The objective of query optimizers is to select a good execution plan for a given query. In a distributed system, it is crucial for a query optimizer to have effective remote cost e...
PODS
1999
ACM
15 years 1 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Decision support queries that scan large indexes can suffer significant degradation in I/O performance due to index fragmentation. DBAs rely on rules of thumb that use index size a...