The complexity of processing tree queries in distributed databases

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 f...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 604 - 611
Main Author: Chihping Wang
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
Computational complexity
Computer science
Costs
Data models
Database systems
Distributed computing
Distributed databases
Marine vehicles
Mathematical programming
Query processing
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143612