193 search results - page 18 / 39 » Processing and Optimization of Complex Queries in Schema-Bas... |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Good cardinality estimates are critical for generating good execution plans during query optimization. Complex predicates, correlations between columns, and user-defined functions...
SIGMOD
1996
ACM
13 years 12 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...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...