Sciweavers

8 search results - page 2 / 2
» The Nested List Normal Form for Functional and Multivalued D...
Sort
View
ACSC
2007
IEEE
13 years 11 months ago
Domination Normal Form - Decomposing Relational Database Schemas
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
Henning Köhler
ADC
2006
Springer
128views Database» more  ADC 2006»
13 years 11 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
HASKELL
2006
ACM
13 years 11 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser