A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Algebraic and calculus database query languages for recursively typed complex objects based on the set and tuple constructs are studied. A fundamental characteristic of such complex objects is that, in them, sets may contain members with arbitrarily deep nesting of tuple and/or set constructs. Relative to mappings from flat relations to flat relations, the algebra without while has the expressive power of the algebra on conventional complex objects with non-recursive types. The algebra plusdoi:10.1016/0022-0000(93)90022-o fatcat:5rbtnj5ymrayxcpo2zgrcowhye