Power of Natural Semijoins

Cited in

(53)

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
Optimization of a subclass of conjunctive queries
Representing triangulated graphs in stars
NP-complete problems simplified on tree schemas
Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
Finding minimum height elimination trees for interval graphs in polynomial time
Graph searches and their end vertices
On the power of structural decompositions of graph-based representations of constraint problems
Tree projections and structural decomposition methods: minimality and game-theoretic characterization
Computing role assignments of chordal graphs
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
Hypertree decompositions and tractable queries
On the notion of cycles in hypergraphs
Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
Tree projections: Game characterization and computational aspects
Querying incomplete information in semistructured data
Multigraph representations of hierarchical loglinear models
Weighted hypertree decompositions and optimal query plans
On the complexity of division and set joins in the relational algebra
Finding intersection models: from chordal to Helly circular-arc graphs
Complexity and approximability of the happy set problem
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
Dynamic programming and planarity: improved tree-decomposition based algorithms
Graph bisection with Pareto optimization
On the expressive power of semijoin queries
Cycle structure of edge labelled graphs
On some partial line graphs of a hypergraph and the associated matroid
GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
A comparison of structural CSP decomposition methods
Minimum average distance clique trees
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
Intersection representations of matrices by subtrees and unicycles on graphs
Structural tractability of enumerating CSP solutions
Interval graphs and related topics
Clique tree generalization and new subclasses of chordal graphs
Corrigendum to: ``Complexity and approximability of the happy set problem
A characterization of multivalued dependencies equivalent to a join dependency
Distributed minimum vertex coloring and maximum independent set in chordal graphs
The dynamic complexity of acyclic hypergraph homomorphisms
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
On the complexity of core, kernel, and bargaining set
An algorithm for handling many relational calculus queries efficiently.
Subgraph trees in graph theory
Connections in acyclic hypergraphs
Characterizing and computing the structure of clique intersections in strongly chordal graphs
The clique-separator graph for chordal graphs
Uniform Constraint Satisfaction Problems and Database Theory
Clique trees of infinite locally finite chordal graphs
Tree decomposition and discrete optimization problems: a survey
The tree projection theorem and relational query processing
The sum-product algorithm: algebraic independence and computational aspects
A review of tree convex sets test
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems

This page was built for publication: Power of Natural Semijoins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923637)