Pages that link to "Item:Q3026382"
From MaRDI portal
The following pages link to On the Desirability of Acyclic Database Schemes (Q3026382):
Displaying 50 items.
- On improving dependency implication algorithms (Q287258) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Path-based supports for hypergraphs (Q450570) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Compositional models and conditional independence in evidence theory (Q553965) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Lossless outer joins with incomplete information (Q583910) (← links)
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- On the discovery of the cycle-axiom of hypergraphs (Q628625) (← 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)
- Connections in acyclic hypergraphs (Q762180) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- A characterization of multivalued dependencies equivalent to a join dependency (Q797316) (← links)
- Acyclic join dependency and data base projections (Q800103) (← links)
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections (Q801698) (← links)
- A formal framework for independence with respect to transactions in the universal relation model (Q803778) (← links)
- Computing the maximum-entropy extension of given discrete probability distributions (Q804113) (← links)
- Unifying functional and multivalued dependencies for relational database design (Q807010) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Hierarchical fault diagnosis for discrete-event systems under global consistency (Q853679) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- A universal table model for categorical databases (Q918682) (← links)
- Testing arbitrary subhypergraphs for the lossless join property (Q918686) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- Estimating high-dimensional intervention effects from observational data (Q1043733) (← 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)
