Results 51 to 60 of about 4,932 (93)

A foundation of CODD's relational maybe-operations

ACM Transactions on Database Systems, 1983
Database relations which possibly contain maybe-tuples and null values of type “value at present unknown” are studied. Maybe-tuples and null values are formally interpreted by our notion of representation , which uses classical notions of predicate logic, elaborates Codd's proposal of maybe-tuples, and adopts Reiter'
openaire   +3 more sources

John Codd Obituary

Educational Philosophy and Theory, 2008
(2008). John Codd Obituary. Educational Philosophy and Theory: Vol. 40, No. 4, pp. 467-470.
openaire   +1 more source

On Codd Families of Keys over Incomplete Relations

The Computer Journal, 2010
Keys allow a database management system to uniquely identify tuples in a database. Consequently, the class of keys is of great significance for almost all data processing tasks. In the relational model of data, keys have received considerable interest and are well understood.
Sven Hartmann, Uwe Leck, Sebastian Link
openaire   +2 more sources

Codde, Pieter

Verzeichnung=Description=Inventaire Mai ...
openaire   +1 more source

codd, n.¹

2023
openaire   +1 more source

codd, n.²

2023
openaire   +1 more source

Codd Piece

The Musical Times, 1996
openaire   +1 more source

Boyce-Codd normal form decomposition

Computers and Mathematics With Applications, 1997
B Gopinath
exaly  

Decomposition of a relation scheme into Boyce-Codd Normal Form

ACM SIGACT News, 1982
Patrick C Fischer
exaly  

Testing for existence of a covering Boyce-Codd normal form

Information Processing Letters, 1979
Sylvia L Osborn
exaly