A Uniform Calculus for Collection Types (1994)
| Venue: | OREGON GRADUATE INSTITUTE OF SCIENE & TECHNOLOGY |
| Citations: | 9 - 0 self |
BibTeX
@TECHREPORT{Fegaras94auniform,
author = {Leonidas Fegaras},
title = {A Uniform Calculus for Collection Types},
institution = {OREGON GRADUATE INSTITUTE OF SCIENE & TECHNOLOGY},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new algebra for collection types based on monoids and monoid homomorphisms. The types supported in this algebra can be any nested composition of collection types, including lists, sets, multisets (bags), vectors, and matrices. We also define a new calculus for this algebra, called monoid comprehensions, that captures operations involving multiple collection types in declarative form. This algebra can easily capture the semantics of many object-oriented database query languages that support mixed collection types, such as the OQL language of the ODMG-93 standard. In addition, it is ideal for expressing data parallelism and nested parallelism and can be effectively translated onto many parallel architectures. We present a normalization algorithm that reduces any expression in our algebra to a canonical form which, when evaluated, generates very few intermediate data structures. These canonical forms are amenable to a higher degree of parallelism than the original...
