Add to ORKGWe show that constructing optimal bushy processing trees for join queriesis NP-hard. More specifically, we show that even the construction of optimal bushy trees for computing the cross product for a set of relations is NP-hard
The generally accepted optimization heuristics of pushing selections down does not yield optimal pla...
Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now...
In this paper, we study the communication complexity for the problem of computing a conjunctive quer...
We show that constructing optimal bushy processing trees for join queriesis NP-hard. More specifical...
One of the main features of XQuery compared to traditional query languages like SQL, is that it pres...
The thesis investigates different problem classes in algebraic query optimization. For the problem o...
. Producing optimal left-deep trees is known to be NP-complete for general join graphs and a quite c...
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...
.<F3.733e+05> Recent developments in database technology, such as deductive database systems, ...
In the literature mainly two variants of dynamic programming for constructing join trees are describ...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than p...
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than p...
The generally accepted optimization heuristics of pushing selections down does not yield optimal pla...
Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now...
In this paper, we study the communication complexity for the problem of computing a conjunctive quer...
We show that constructing optimal bushy processing trees for join queriesis NP-hard. More specifical...
One of the main features of XQuery compared to traditional query languages like SQL, is that it pres...
The thesis investigates different problem classes in algebraic query optimization. For the problem o...
. Producing optimal left-deep trees is known to be NP-complete for general join graphs and a quite c...
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...
.<F3.733e+05> Recent developments in database technology, such as deductive database systems, ...
In the literature mainly two variants of dynamic programming for constructing join trees are describ...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than p...
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than p...
The generally accepted optimization heuristics of pushing selections down does not yield optimal pla...
Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now...
In this paper, we study the communication complexity for the problem of computing a conjunctive quer...