Computer Science – Databases
Scientific paper
2012-02-02
Computer Science
Databases
18 pages, 8 figures. arXiv admin note: text overlap with arXiv:cs/0607039
Scientific paper
The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that are adequate for database use. The operations are similar to those of Codd's relational algebra, but differ in being based on a mathematically adequate theory of relations. The semantics of predicate calculus, being oriented toward the concept of satisfiability, is not suitable for relational databases. We develop an alternative semantics that assigns relations as meaning to formulas with free variables. This semantics makes the classical predicate calculus suitable as a query language for relational databases.
Kelly Philip
van Emden M. H.
No associations
LandOfFree
Relational Semantics for Databases and Predicate Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Relational Semantics for Databases and Predicate Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relational Semantics for Databases and Predicate Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-188070