116 search results - page 17 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
110
click to vote
PODC
2003
ACM
15 years 4 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
96
Voted
EDBT
2006
ACM
15 years 11 months ago
2006
ACM
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
77
Voted
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...