codd's reduction algorithm

Computing Dictionary

Codd's reduction algorithm definition

An algorithm to convert an arbitrary expression of the relational calculus to an equivalent expression of the relational algebra. This can be used as the basis of an implementation of the relational calculus.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: codd's first normal form
Next Definition: codder
More from
Synonyms and Antonyms for Codd's reduction algorithm
More from
Search for articles containing Codd's reduction algorithm Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature