OnlineWoerterBuecher.de
Internes

Lexikon


relational calculus


ATabase> An operATional methodolgy, founded on {predicATe calculus}, dealing with descripitive expressions thAT are equivalent to the operATions of relATional algebra. {Codd' s reduction algorithm} can convert from {relATional calculus} to relATional algebra. Two forms of the relATional calculus exist: the {tuple calculus} and the {domain calculus}. ["An Introduction To DATabase Systems" (6th ed), C. J. DATe, Addison Wesley]. (1998-10-05)

In addition suitable contents:
[ = ] [ ai ] [ al ] [ algebra ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ AT ] [ b ] [ ba ] [ base ] [ br ] [ C ] [ ca ] [ cAT ] [ ch ] [ co ] [ Codd' s reduction algorithm ] [ con ] [ cr ] [ cu ] [ D ] [ dATa ] [ dATabase ] [ dd ] [ de ] [ do ] [ domain ] [ domain calculus ] [ du ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ et ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ forms ] [ fr ] [ ge ] [ gy ] [ h ] [ hAT ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ J ] [ la ] [ lc ] [ Lex ] [ li ] [ lu ] [ ma ] [ method ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ ng ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ pr ] [ predicATe calculus ] [ query ] [ rATional ] [ rc ] [ re ] [ reduction ] [ relATion ] [ relATional algebra ] [ ro ] [ S ] [ sc ] [ se ] [ si ] [ sl ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tuple ] [ tuple calculus ] [ up ] [ us ] [ va ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4489 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0896 Seconds, with 16 Database-Queries
Zurück zur Startseite