116 search results - page 7 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
SIGMOD
1993
ACM
15 years 1 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
ICDE
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
80
Voted
EDBTW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
158
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
DEBU
2008
14 years 9 months ago
2008
Query optimization is an inherently complex problem, and validating the correctness and effectiveness of a query optimizer can be a task of comparable complexity. The overall proc...