The complexity of processing tree queries in distributed databases

Authors:
Chihping Wang
Affiliations:
Dept. of Comput. Sci., California Univ., Riverside, CA, USA
Venue:
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Year:
1990

Citing 0
Cited 7

Database placement in communication networks for minimizing the overall transmission cost

Mathematical and Computer Modelling: An International Journal
Incorporating processor costs in optimizing the distributed execution of join queries

Mathematical and Computer Modelling: An International Journal
The propagation of updates to relational tables in a distributed database system

Mathematical and Computer Modelling: An International Journal
Allocating relations in a distributed database system

Mathematical and Computer Modelling: An International Journal
Evaluating multiple join queries in a distributed database system

Mathematical and Computer Modelling: An International Journal
Minimizing the response time of executing a join between fragmented relations in a distributed database system

Mathematical and Computer Modelling: An International Journal
Executing join queries in an uncertain distributed environment

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semi-joins have been introduced to reduce the cost of processing distributed queries. The determine the optimal semi-join processing strategy, one must consider both the reduction effect and the transmission overhead. Researchers have studied the problem of finding the optimal semi-join strategies for processing tree queries. Although a number algorithms have been proposed, they either have a very high complexity or only solve special cases. It is conjectured that the tree query processing problem is inherently difficult. The author formally answers this question by proving it NP-hard.