| Beeri, C. and Milo, T. Functional and predicative programming in OODBs, Proc. ACM PODS, San Diego, June 1992, pp 176-190. |
....of type fag and returns the union of the results. Notice that setmap f is just OE f ( fg. Bre91] similarly gives a finite set version of setmap defined in terms of Phi. Two functions that frequently appear in algebras are map : a b) fag fbg and f ilter : a Bool) fag fag e.g. in [Clu92, Bee92]. These functions generalise relational projection and selection. Although they could be built in for efficiency purposes, map and f ilter can be defined in terms of setmap as follows, where singleton f x = ff xg: filter f s = setmap (x.if (f x) fxg fg) s map f s = setmap (singleton f ) s A ....
Beeri, C. and Milo, T. Functional and predicative programming in OODBs, Proc. ACM PODS, 1992.
No context found.
Beeri, C. and Milo, T. Functional and predicative programming in OODBs, Proc. ACM PODS, San Diego, June 1992, pp 176-190.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC