Please use this identifier to cite or link to this item:
|Title:||Reflective programming in the relational algebra||Authors:||VAN DEN BUSSCHE, Jan
van Gucht, D.
|Issue Date:||1996||Publisher:||Academic Press, Inc.||Source:||Journal of computer and system sciences, 52(3). p. 537-549||Abstract:||This 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.||Document URI:||http://hdl.handle.net/1942/6550||DOI:||10.1006/jcss.1996.0040||Type:||Journal Contribution|
|Appears in Collections:||Research publications|
Show full item record
checked on Sep 2, 2020
WEB OF SCIENCETM
checked on May 14, 2022
checked on May 17, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.