Relational model

related topics
{math, number, function}
{theory, work, human}
{government, party, election}
{system, computer, user}
{company, market, business}
{rate, high, increase}
{mi², represent, 1st}

The relational model for database management is a database model based on first-order predicate logic, first formulated and proposed in 1969 by E.F. Codd.[1][2][3]

Contents

Overview

Its central idea was to describe a database as a collection of predicates over a finite set of predicate variables, describing constraints on the possible values and combinations of values. The content of the database at any given time is a finite (logical) model of the database, i.e. a set of relations, one per predicate variable, such that all predicates are satisfied. A request for information from the database (a database query) is also a predicate.

Full article ▸

related documents
Combinatory logic
Prolog
System of linear equations
Linear programming
Big O notation
Laplace transform
Spinor
Quadratic reciprocity
Fibonacci number
Red-black tree
Banach–Tarski paradox
Formal power series
Trigonometric functions
Lebesgue integration
Wikipedia:Free On-line Dictionary of Computing/R - S
Field (mathematics)
Lambda calculus
P-adic number
Determinant
Bernoulli number
Linked list
Binary search algorithm
Computer numbering formats
Travelling salesman problem
Binomial coefficient
Discrete cosine transform
Grothendieck topology
Distribution (mathematics)
Mandelbrot set
Pythagorean triple