Pages that link to "Item:Q3026382"
From MaRDI portal
The following pages link to On the Desirability of Acyclic Database Schemes (Q3026382):
Displayed 50 items.
- 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)
- Connections in acyclic hypergraphs (Q762180) (← 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)
- 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)
- 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)
- 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)
- Distributed revision of composite beliefs (Q1096412) (← links)
- Existence of extensions and product extensions for discrete probability distributions (Q1098477) (← links)
- Interaction-free multivalued dependency sets (Q1111777) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Tree clustering for constraint networks (Q1116363) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Recognizing single-peaked preferences on a tree (Q1122456) (← links)
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies (Q1123008) (← links)
- Relational decomposition and structural analysis of systems (Q1123026) (← links)
- Inferring multivalued dependencies from functional and join dependencies (Q1168088) (← links)
- An inertia formula for Hermitian matrices with sparse inverses (Q1183205) (← links)
- Design of desirable relational database schemes (Q1201884) (← links)
- Structure identification in relational data (Q1204870) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A characterization of finite fd-acyclicity (Q1264004) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Paths and cycles of hypergraphs (Q1283074) (← links)
- Unique complements and decompositions of database schemata (Q1318468) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)