Polymorphic type inference for the relational algebra
Preprint
Abstract
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given expression. The principal type of an expression is a formula that specifies, in a clear and concise manner, all assignments of types (sets of attributes) to relation names, under which a given relational algebra expression is well-typed, as well as the output type that expression will have under each of these assignments. Topics discussed include complexity and polymorphic expressive power.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Basic Simple Type Theory1997
- The TSIMMIS Approach to Mediation: Data Models and LanguagesJournal of Intelligent Information Systems, 1997
- Adding structure to unstructured data1997
- A query language and optimization techniques for unstructured dataACM SIGMOD Record, 1996
- Polymorphism and type inference in database programmingACM Transactions on Database Systems, 1996
- Type Inference: Some Results, Some Problems1Fundamenta Informaticae, 1993
- Typing record concatenation for free1992
- Database programming in Machiavelli—a polymorphic language with static type inferenceACM SIGMOD Record, 1989