Abstract

We develop a query language based on graph-based schemas. We prove that the resulting algebraic approach is closed under composition, and give an implementation for it using a key generation operation. We also show how this approach can be implemented in relational algebra (SPCU) by extending it with key generation.