Pages that link to "Item:Q3026383"
From MaRDI portal
The following pages link to Degrees of acyclicity for hypergraphs and relational database schemes (Q3026383):
Displaying 50 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- The colorful Helly theorem and general hypergraphs (Q412268) (← links)
- Block-wise construction of tree-like relational features with monotone reducibility and redundancy (Q413862) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs (Q456059) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Lossless outer joins with incomplete information (Q583910) (← links)
- On some partial line graphs of a hypergraph and the associated matroid (Q686485) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections (Q801698) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Hierarchical fault diagnosis for discrete-event systems under global consistency (Q853679) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Testing arbitrary subhypergraphs for the lossless join property (Q918686) (← links)
- An algebra of probability over finite product spaces, with applications (Q919365) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- On the notion of cycles in hypergraphs (Q1045194) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- On the existence of acyclic views in a database scheme (Q1060030) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- The tree projection theorem and relational query processing (Q1061514) (← links)
- Interaction-free multivalued dependency sets (Q1111777) (← links)
- On the desirability of \(\gamma\)-acyclic BCNF database schemes (Q1111780) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Relational decomposition and structural analysis of systems (Q1123026) (← links)
- Connection-trap-free database schemes (Q1185238) (← links)
- Generating hinges from arbitrary subhypergraphs (Q1197992) (← links)
- Inferring null join dependencies in relational databases (Q1198969) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Optimal distributed execution of join queries (Q1328829) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Incorporating processor costs in optimizing the distributed execution of join queries (Q1336868) (← links)
- The nested universal relation data model (Q1342865) (← links)
- Characterization of desirable properties of general database decompositions. (Q1353960) (← links)
- Minimizing the response time of executing a join between fragmented relations in a distributed database system (Q1362219) (← links)
