Pages that link to "Item:Q1154820"

The following pages link to On the computational complexity of cardinality constraints in relational databases (Q1154820):

Displaying 3 items.

• I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration (Q736613) (← links)
• Incorporating cardinality constraints and synonym rules into conditional functional dependencies (Q989485) (← links)
• Inferences for numerical dependencies (Q1079963) (← links)