Persistent sets - an alternative to relational databases

dc.contributor.author	Berman, S.
dc.date.accessioned	2026-02-27T15:38:24Z
dc.date.available	2026-02-27T15:38:24Z
dc.date.issued	1989-11-29
dc.identifier.citation	Berman, S. 1989. Persistent sets - an alternative to relational databases. In: Kritzinger, P. (Ed.) 1989. Proceedings of the 5th Southern African Computer Symposium, 1989. Cape Town: SAICS, pp. 157-167.	en_US
dc.identifier.uri	https://ir.unisa.ac.za/handle/10500/32212
dc.description	Database systems	en_US
dc.description.abstract	Persistent programming languages, which extend conventional languages to treat database data as well, are becoming viable alternatives to Database Management Systems. However, they are currently lacking in one essential feature: a bulk data type. The P-Pascal language, currently nearing completion, has been developed in order to remedy this; exploring the use of orthogonal sets in such a role. This paper describes the concept of a persistent set and how it can be used in programs. The internal representation and manipulation of these objects is outlined, and some directions for future work mentioned.	en_US
dc.language.iso	en	en_US
dc.publisher	SAICS	en_US
dc.subject	Persistence	en_US
dc.subject	Bulk data	en_US
dc.subject	Relational algebra	en_US
dc.title	Persistent sets - an alternative to relational databases	en_US
dc.type	Book chapter	en_US