Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Extending the relational algebra to capture less meaning

Extending the relational algebra to capture less meaning Mc.Gill . UnJvermty School of Computer Science Burnside Hall (514) 392-8275 Extending the Relational Algebra to Capture Less Meaning T. H. Merrett McGill University Montreal We argue that systems of operations on data are most effective when they are formalisms, in which semantic considerations are unimportant until the formalism is applied to some specific application. In this way, database processing can join the ranks of successful mathematical abstractions. Differential equations, for instance, can be applied to situations ranging from orbit calculations to the quantum mechanics of the atom. The semantics of each application is unique to that application, but the formalism of differential equations is common. The power of the formalism lies in its abstraction from issues of meaning. This paper explores extensions to the relational algebra, made with practicality in mind, but under the constraint of generality, i.e., freedom from being limited to particular interpretations. By going to the foundations of the relational model in m a t h e m a t i c a l set theory we can generalize the now classical operations of projection, restriction, natural join and division to two useful families of binary operations and a flexible unary operator w h http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMOD Record Association for Computing Machinery

Extending the relational algebra to capture less meaning

Merrett, T. H.
ACM SIGMOD Record , Volume 14 (3) – Nov 1, 1984
Download PDF
14 pages

Loading next page...
 
/lp/association-for-computing-machinery/extending-the-relational-algebra-to-capture-less-meaning-hFXeSQ9NKa
Publisher
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISSN
0163-5808
DOI
10.1145/984549.984552
Publisher site
See Article on Publisher Site

Abstract

Mc.Gill . UnJvermty School of Computer Science Burnside Hall (514) 392-8275 Extending the Relational Algebra to Capture Less Meaning T. H. Merrett McGill University Montreal We argue that systems of operations on data are most effective when they are formalisms, in which semantic considerations are unimportant until the formalism is applied to some specific application. In this way, database processing can join the ranks of successful mathematical abstractions. Differential equations, for instance, can be applied to situations ranging from orbit calculations to the quantum mechanics of the atom. The semantics of each application is unique to that application, but the formalism of differential equations is common. The power of the formalism lies in its abstraction from issues of meaning. This paper explores extensions to the relational algebra, made with practicality in mind, but under the constraint of generality, i.e., freedom from being limited to particular interpretations. By going to the foundations of the relational model in m a t h e m a t i c a l set theory we can generalize the now classical operations of projection, restriction, natural join and division to two useful families of binary operations and a flexible unary operator w h

Journal

ACM SIGMOD Record – Association for Computing Machinery

Published: Nov 1, 1984

There are no references for this article.