Layout and Implementation

Abstract

In the previous chapter we have described how data relations of arbitrary arity and nesting structure may be graphically encoded. We have designed a resource allocation process in which graphical relations were used to encode the relation domains as well as the tuples binding the domain objects together. We have, however, not addressed the question on how to realise the encoding decisions made to concretely generate the designs. This will be the subect of this chapter.