116 search results - page 11 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
92
Voted
VLDB
1999
ACM
15 years 3 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
165
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...