Power of Natural Semijoins
From MaRDI portal
Publication:3923637
DOI10.1137/0210059zbMATH Open0469.68090OpenAlexW2046649829MaRDI QIDQ3923637FDOQ3923637
Nathan Goodman, Philip A. Bernstein
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210059
Cited In (54)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- Cycle structure of edge labelled graphs
- On some partial line graphs of a hypergraph and the associated matroid
- An algorithm for handling many relational calculus queries efficiently.
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
- Tree decomposition and discrete optimization problems: a survey
- Finding intersection models: from chordal to Helly circular-arc graphs
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
- Subgraph trees in graph theory
- Representing triangulated graphs in stars
- Uniform Constraint Satisfaction Problems and Database Theory
- Connections in acyclic hypergraphs
- A REVIEW OF TREE CONVEX SETS TEST
- Hypertree decompositions and tractable queries
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Clique trees of infinite locally finite chordal graphs
- Tree Projections: Game Characterization and Computational Aspects
- Querying incomplete information in semistructured data
- Multigraph representations of hierarchical loglinear models
- Computing role assignments of chordal graphs
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- A comparison of structural CSP decomposition methods
- Corrigendum to: ``Complexity and approximability of the happy set problem
- Weighted hypertree decompositions and optimal query plans
- On the complexity of division and set joins in the relational algebra
- Graph Bisection with Pareto Optimization
- The tree projection theorem and relational query processing
- The clique-separator graph for chordal graphs
- Interval graphs and related topics
- Finding minimum height elimination trees for interval graphs in polynomial time
- Graph searches and their end vertices
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- On the expressive power of semijoin queries
- Structural tractability of enumerating CSP solutions
- Complexity and approximability of the happy set problem
- Towards a characterization of leaf powers by clique arrangements
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Distributed minimum vertex coloring and maximum independent set in chordal graphs
- The dynamic complexity of acyclic hypergraph homomorphisms
- On the notion of cycles in hypergraphs
- Clique tree generalization and new subclasses of chordal graphs
- Minimum Average Distance Clique Trees
- NP-complete problems simplified on tree schemas
- On the complexity of core, kernel, and bargaining set
- Optimization of a subclass of conjunctive queries
- Intersection representations of matrices by subtrees and unicycles on graphs
- A characterization of multivalued dependencies equivalent to a join dependency
- On the power of structural decompositions of graph-based representations of constraint problems
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
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)
