Institutional Repository

Generating relations using formal grammars

Show simple item record

dc.contributor.author von Solms, S. H.
dc.date.accessioned 2018-06-06T09:01:30Z
dc.date.available 2018-06-06T09:01:30Z
dc.date.issued 1987
dc.identifier.citation S.H. von Solms (1987) Generating relations using formal grammars. Quaestiones Informaticae Vol 5 No 3 1987 en
dc.identifier.issn 0254-2757
dc.identifier.uri http://hdl.handle.net/10500/24249
dc.description.abstract Grammars generating 2-dimensional arrays have been studied by many people [1, 2, 3, 4). One effort was Random Context Array Grammars [4], where different types of context conditions placed on the production, were used to control the generating process. Relations, as used in relational data bases, can be considered as rectangular arrays, and therefore it should be possible to generate and manipulate relations using 2-dimensional Grammars. Simple Relation Grammars generate relations, and can simulate some unary operations like select and project on these relations. Extended Relation Grammars also generate relations, but these relations can communicate with each other within a "Extended Relation Schema (ERS)". Within such an ERS binary operations like union and join can be simulated. This paper is a summary of a research project of which certain parts have already been submitted for publication. en
dc.language.iso en en
dc.publisher Computer Society of South Africa (on behalf of SAICSIT) en
dc.title Generating relations using formal grammars en
dc.type Article en
dc.description.department School of Computing en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics