Pages that link to "Item:Q3026383"
From MaRDI portal
The following pages link to Degrees of acyclicity for hypergraphs and relational database schemes (Q3026383):
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)
- 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)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Hierarchical fault diagnosis for discrete-event systems under global consistency (Q853679) (← 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)
- Evaluating multiple join queries in a distributed database system (Q1804921) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- The existence condition of \(\gamma\)-acyclic database schemes with MVDs constraints. (Q1850678) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Executing join queries in an uncertain distributed environment (Q1900302) (← links)
- Allocating relations in a distributed database system (Q1903394) (← links)
- Optimising the distributed execution of join queries in polynomial time (Q1962961) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- An algorithm for determining minimal reduced-coverings of acyclic database schemes (Q2365507) (← links)
- Doubly lexical ordering of dense 0--1 matrices (Q2366069) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Prediction-hardness of acyclic conjunctive queries (Q2581365) (← links)
- Entity-relationship diagrams which are in BCNF (Q3038661) (← links)