Pages that link to "Item:Q3939277"
From MaRDI portal
The following pages link to On the Complexity of Testing Implications of Functional and Join Dependencies (Q3939277):
Displayed 13 items.
- On improving dependency implication algorithms (Q287258) (← links)
- On minimal constraint networks (Q359976) (← links)
- Appropriate inferences of data dependencies in relational databases (Q429431) (← links)
- Characterisations of multivalued dependency implication over undetermined universes (Q439967) (← links)
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration (Q736613) (← links)
- An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
- Independent database schemas (Q1082831) (← links)
- Inferring multivalued dependencies from functional and join dependencies (Q1168088) (← links)
- On the representation and querying of sets of possible worlds (Q1174717) (← links)
- Characterization of desirable properties of general database decompositions. (Q1353960) (← links)
- A corrected 5NF definition for relational database design (Q1390959) (← links)
- Querying incomplete data over extended ER schemata (Q3577711) (← links)
- Structure of closures in relational schemas with join and functional dependencies (Q4007427) (← links)