Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/714

Title: Polymorphic type inference for the relational algebra
Waller, Emmanuel
Issue Date: 2002
Publisher: Elsevier
Citation: Journal of Computer and System Sciences, 64(3). p. 694-718
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.
URI: http://hdl.handle.net/1942/714
DOI: 10.1006/jcss.2001.1812
ISI #: 000176291700009
ISSN: 0022-0000
Category: A1
Type: Journal Contribution
Validation: ecoom, 2003
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A227.18 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.