Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

112

Voted

PODS
1999
ACM

79views Database» more PODS 1999»

Hypertree Decompositions and Tractable Queries

15 years 8 months ago

Hypertree Decompositions and Tractable Queries

Download www.mat.unical.it

Georg Gottlob, Nicola Leone, Francesco Scarcello

Real-time Traffic

Database | PODS 1999 |

claim paper

Related Content

» Generalized hypertree decompositions nphardness and tractable variants

» Backtracking Procedures for Hypertree HyperSpread and Connected Hypertree Decomposition of...

» Approximating fractional hypertree width

» Query answering exploiting structural properties

» A unified theory of structural tractability for constraint satisfaction problems

» Weighted Hypertree Decompositions and Optimal Query Plans

» Bounding Search Space Size via Hypertree Decompositions

» Aggregation in Probabilistic Databases via Knowledge Compilation

» Approximate Confidence Computation in Probabilistic Databases

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	PODS
Authors	Georg Gottlob, Nicola Leone, Francesco Scarcello

Comments (0)