Sciweavers

39 search results - page 4 / 8
» Logical Database Design with Inclusion Dependencies
Sort
View
HASKELL
2006
ACM
15 years 3 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
ICDT
2012
ACM
247views Database» more  ICDT 2012»
12 years 12 months ago
A normal form for preventing redundant tuples in relational databases
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
Hugh Darwen, C. J. Date, Ronald Fagin
79
Voted
CONSTRAINTS
2008
70views more  CONSTRAINTS 2008»
14 years 9 months ago
Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
Hadrien Cambazard, Barry O'Sullivan
ISMIS
1994
Springer
15 years 1 months ago
Reasoning About the Safety of Information: From Logical Formalization to Operational Definition
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
Laurence Cholvy, Robert Demolombe, Andrew J. I. Jo...
PODS
2004
ACM
158views Database» more  PODS 2004»
15 years 9 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...