Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard

Authors:
Guido Moerkotte;Wolfgang Scheufele
Affiliations:
-;-
Venue:
Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard
Year:
1996

Citing 0
Cited 2

Index structures and algorithms for querying distributed RDF repositories

Proceedings of the 13th international conference on World Wide Web
Towards distributed processing of RDF path queries

International Journal of Web Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that constructing optimal bushy processing trees for join queries is 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.