5 search results - page 1 / 1 » Bypassing Joins in Disjunctive Queries |
VLDB
1995
ACM
13 years 8 months ago
1995
ACM
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...