Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/6550
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorvan Gucht, D.-
dc.contributor.authorVossen, G.-
dc.date.accessioned2007-12-20T16:08:45Z-
dc.date.available2007-12-20T16:08:45Z-
dc.date.issued1996-
dc.identifier.citationJournal of computer and system sciences, 52(3). p. 537-549-
dc.identifier.urihttp://hdl.handle.net/1942/6550-
dc.description.abstractThis paper introduces a reflective extension of the relational algebra. Reflection is achieved by storing and manipulating relational algebra programs as relations and by adding a LISP-like evaluation operation to the algebra. We first show that this extension, which we call the reflective algebra, can serve as a unifying formalization of various forms of procedural data management which have been considered in database systems research. We then study the expressive power and complexity of the reflective algebra. In particular, we establish a close correspondence between reflection and bounded looping, and between tail-recursive reflection and unbounded looping. These correspondences yield new logical characterizations of PTIME and PSPACE.-
dc.language.isoen-
dc.publisherAcademic Press, Inc.-
dc.titleReflective programming in the relational algebra-
dc.typeJournal Contribution-
dc.identifier.epage549-
dc.identifier.issue3-
dc.identifier.spage537-
dc.identifier.volume52-
dc.bibliographicCitation.oldjcat-
dc.identifier.doi10.1006/jcss.1996.0040-
item.fullcitationVAN DEN BUSSCHE, Jan; van Gucht, D. & Vossen, G. (1996) Reflective programming in the relational algebra. In: Journal of computer and system sciences, 52(3). p. 537-549.-
item.fulltextNo Fulltext-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorvan Gucht, D.-
item.contributorVossen, G.-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

SCOPUSTM   
Citations

16
checked on Sep 14, 2025

WEB OF SCIENCETM
Citations

13
checked on Sep 11, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.