Weighted hypertree decompositions and optimal query plans
type: Item
instance of: scholarly article
title: Weighted hypertree decompositions and optimal query plans
zbMATH Open document ID: 1115.68068
author: Francesco Scarcello
author: Gianluigi Greco
author: N. Leone
published in: Journal of Computer and System Sciences
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5146911
zbMATH Keywords: query processing
zbMATH Keywords: computational complexity
zbMATH Keywords: decomposition methods
zbMATH Keywords: hypergraphs
zbMATH Keywords: relational databases
MaRDI profile type: Publication
full work available at URL: j.jcss.2006.10.010
OpenAlex ID: W2057186622
cites work: Q4864249
cites work: On the Desirability of Acyclic Database Schemes
cites work: Power of Natural Semijoins
cites work: Alternation
cites work: Conjunctive query containment revisited
cites work: Query evaluation via tree-decompositions
cites work: A sufficient condition for backtrack-bounded search
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A comparison of structural CSP decomposition methods
cites work: The complexity of acyclic conjunctive queries
cites work: Hypertree decompositions and tractable queries
cites work: Computing LOGCFL certificates
cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
cites work: The Hardest Context-Free Language
cites work: When is the evaluation of conjunctive queries tractable?
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: Q4385525
cites work: Conjunctive-query containment and constraint satisfaction
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Tree-size bounded alternation
cites work: A complexity theory based on Boolean algebra
cites work: Q4142695
DOI: 10.1016/J.JCSS.2006.10.010
Recommended article: Hypertree decompositions and tractable queries
Recommended article: Path Queries in Weighted Trees
Recommended article: Succinct representations of weighted trees supporting path queries
Recommended article: Query evaluation via tree-decompositions
Recommended article: Q4473259
Recommended article: Computing Optimal Hypertree Decompositions
Recommended article: Optimization of distributed tree queries
Recommended article: Q5875608
Recommended article: Path Minima Queries in Dynamic Weighted Trees
Recommended article: Weighted Treewidth Algorithmic Techniques and Results
description: scientific article; zbMATH DE number 5146911