In the database context, the hypertree decomposition method is used for query optimization, whereby conjunctive queries having a low degree of cyclicity can be recognized and decomposed automatically, and efficiently evaluated. Hypertree decompositions were introduced at ACM PODS 1999. The present paper reviews-in form of questions and answers-the main relevant concepts and algorithms and surveys selected related work including applications and test results.
Hypertree decompositions: Questions and answers
GRECO, Gianluigi;LEONE, Nicola;SCARCELLO F.
2016-01-01
Abstract
In the database context, the hypertree decomposition method is used for query optimization, whereby conjunctive queries having a low degree of cyclicity can be recognized and decomposed automatically, and efficiently evaluated. Hypertree decompositions were introduced at ACM PODS 1999. The present paper reviews-in form of questions and answers-the main relevant concepts and algorithms and surveys selected related work including applications and test results.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
