OnlineWoerterBuecher.de
Internes

Lexikon


relational algebra


A family of algebra with a well-founded semantics used for modelling the data stored in {relational databases}, and defining queries on it. The main operations of the relational algebra are the set operations (such as union, intersection, and cartesian product), selection (keeping only some lines of a table) and the projection (keeping only some columns). The relational data model describes how the data is structured. Codd' s reduction algorithm can convert from {relational calculus} to {relational algebra}. (1997-02-17)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ algebra ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ be ] [ br ] [ C ] [ ca ] [ ch ] [ co ] [ Codd' s reduction algorithm ] [ con ] [ cr ] [ cu ] [ data ] [ database ] [ data model ] [ dd ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ h ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ is ] [ it ] [ ke ] [ la ] [ lc ] [ Lex ] [ li ] [ line ] [ lu ] [ ly ] [ ma ] [ man ] [ mil ] [ mn ] [ mo ] [ mod ] [ mode ] [ model ] [ modelling ] [ module ] [ na ] [ ne ] [ ng ] [ ni ] [ nl ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ ping ] [ pr ] [ product ] [ projection ] [ query ] [ rc ] [ re ] [ reduction ] [ relation ] [ relational calculus ] [ relational database ] [ relational data model ] [ ro ] [ ru ] [ sc ] [ se ] [ semantics ] [ set ] [ si ] [ so ] [ st ] [ store ] [ struct ] [ su ] [ T ] [ table ] [ th ] [ theory ] [ to ] [ tr ] [ um ] [ union ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (5814 Reads)

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

Page Generation in 0.098 Seconds, with 17 Database-Queries
Zurück zur Startseite