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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 604 - 611
Hlavní autor: Chihping Wang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
Computational complexity
Computer science
Costs
Data models
Database systems
Distributed computing
Distributed databases
Marine vehicles
Mathematical programming
Query processing
ISBN:0818620870, 9780818620874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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