On the complexity of join dependencies
From MaRDI portal
Recommendations
Cited in
(20)- Local consistency for extended CSPs
- Losslessness and project-join constructibility in relational databases
- Join dependencies in relational-database design
- Decomposing constraint satisfaction problems using database techniques
- Complete decompositions of join dependencies
- Accelerating new product development by overcoming complexity constraints
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Domain filtering consistencies for non-binary constraints
- On the join dependency relation in multinomial lattices
- Size bounds and query plans for relational joins
- A formal context for acyclic join dependencies
- On acyclic database decompositions
- scientific article; zbMATH DE number 4043317 (Why is no real title available?)
- A Generalization of the Inference Rules for Join Dependencies in Databases
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- Enumeration complexity of conjunctive queries with functional dependencies
- Acyclic join dependency and data base projections
- Problem of optimizing the number of block accesses in performing relational join is NP-hard
- Strictly chordal graphs are leaf powers
- Testing arbitrary subhypergraphs for the lossless join property
This page was built for publication: On the complexity of join dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738613)
