Add to ORKGTwo approaches to derive dynamic programming algorithms for constructing join trees are described in the literature. We show analytically and experimentally that these two variants exhibit vastly diverging runtime behaviors for different query graphs. More specifically, each variant is superior to the other for one kind of query graph (chain or clique), but fails for the other. Moreover, neither of them handles star queries well. This motivates us to derive an algorithm that is superior to the two existing algorithms because it adapts to the search space implied by the query graph
[[abstract]]The authors identify some optimality properties of a special type of tree queries, namel...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...
The dynamic tree problem is that of maintaining an arbitrary n-vertex for-est that changes over time...
Two approaches to derive dynamic programming algorithms for constructing join trees are described in...
Two approaches to derive dynamic programming algorithms for constructing join trees are described in...
In the literature mainly two variants of dynamic programming for constructing join trees are describ...
A major task in query optimization is finding an optimal or near-optimal order to perform join opera...
Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products...
One of the main features of XQuery compared to traditional query languages like SQL, is that it pres...
We show that constructing optimal bushy processing trees for join queriesis NP-hard. More specifical...
.<F3.733e+05> Recent developments in database technology, such as deductive database systems, ...
AbstractIn this paper the problem of finding an optimum strategy of semi joins for solving tree quer...
. Producing optimal left-deep trees is known to be NP-complete for general join graphs and a quite c...
The thesis investigates different problem classes in algebraic query optimization. For the problem o...
Structural join operations are central to evaluating queries against XML data, and are typically the...
[[abstract]]The authors identify some optimality properties of a special type of tree queries, namel...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...
The dynamic tree problem is that of maintaining an arbitrary n-vertex for-est that changes over time...
Two approaches to derive dynamic programming algorithms for constructing join trees are described in...
Two approaches to derive dynamic programming algorithms for constructing join trees are described in...
In the literature mainly two variants of dynamic programming for constructing join trees are describ...
A major task in query optimization is finding an optimal or near-optimal order to perform join opera...
Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products...
One of the main features of XQuery compared to traditional query languages like SQL, is that it pres...
We show that constructing optimal bushy processing trees for join queriesis NP-hard. More specifical...
.<F3.733e+05> Recent developments in database technology, such as deductive database systems, ...
AbstractIn this paper the problem of finding an optimum strategy of semi joins for solving tree quer...
. Producing optimal left-deep trees is known to be NP-complete for general join graphs and a quite c...
The thesis investigates different problem classes in algebraic query optimization. For the problem o...
Structural join operations are central to evaluating queries against XML data, and are typically the...
[[abstract]]The authors identify some optimality properties of a special type of tree queries, namel...
[[abstract]]The properties of optimal semi-join programs for processing distributed tree queries are...
The dynamic tree problem is that of maintaining an arbitrary n-vertex for-est that changes over time...