V. Tannen, Tutorial: Languages for collection types, in "Proceedings of 13th Symposium on Principles of Database Systems," Minneapolis, May 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....languages to the full paper. The use of nonstandard universes (as opposed to elementary extensions) allows one to work with hyperfinite extensions of traditional aggregates constructs such as Counts, Sums, and set formers. For example, consider the query Q over complex objects (see [5] [25], asking whether a given set of sets A contains two sets of differing parity. One can show this query to be inexpressible in the nested relational algebra [5] a higherorder analog of the relational algebra, by considering a natural counterexample: two hyperfinite structures S 1 and S 2 , the ....

V. Tannen, Tutorial: Languages for collection types, in "Proceedings of 13th Symposium on Principles of Database Systems," Minneapolis, May 1994.

....calculus. This technique is a variant of Gaifman s locality theorem [19] but it is often easier to apply, because it is a statement about semantic properties of queries, rather than their syntactic representation. Organization and summary of main results. In Section 2 we outline a recent approach [6, 8, 53, 9] to designing query languages for collection types. This approach is based on turning universal properties of collections into programming syntax. Applying it to complex objects, we obtain a nested relational language called NRL. The language resulting from adding equality test to NRL, denoted by ....

V. Tannen, Tutorial: Languages for collection types, in "Proceedings of 13th Symposium on Principles of Database Systems," Minneapolis, May 1994.

....such as in [8] This approach to the language design has proved extremely fruitful and allowed to solve some open problems and develop languages for other collections. The reader who is interested in other applications of this approach and in mathematical constructions behind it is referred to [23]. In order to apply the data oriented paradigm to the approximation constructs, we first need formal models of those, and then the universality properties for those models. 3 Formal models of approximations In this section we reexamine the approximation constructs by applying the idea of ....

V. Tannen. Tutorial: Languages for collection types. In PODS-94, pages 150--154.

....we have done here is only to sketch the basic idea. A considerable amount of design work remains to flesh it out into a concrete design, even assuming the existence of multi parameter constructor classes. 5 Related work There is a large literature on collection types, also known as bulk types. Tannen [1994] gives a useful bibliography, from a database perspective. Buneman et al. 1995] explores the algebra and expressiveness of algebras based on (empty, insert) and (empty, singleton, union) C has a well developed library called the Standard Template Library (STL) which is specifically aimed at ....

V Tannen [1994], "Tutorial: languages for collection types," University of Pennsylvania.

No context found.

V. Tannen, Tutorial: Languages for collection types, in "Proceedings of 13th Symposium on Principles of Database Systems," Minneapolis, May 1994.

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