Reflective programming in the relational algebra

  • Authors:
  • Jan Van den Bussche;Dirk Van Gucht;Gottfried Vossen

  • Affiliations:
  • Univ. of Antwerp, Antwerp, Belgium;Indiana Univ., Bloomington;Univ. Giessen, Giessen, Germany

  • Venue:
  • PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

In reflective programming languages it is possible for a program to generate code that is integrated into the program's own execution. We introduce a reflective version of the relational algebra. Reflection is achieved by storing and manipulating relational algebra programs as relations in the database. We then study the expressibility and complexity of the reflective algebra thus obtained. It turns out that there is a close correspondence between reflection and bounded looping. We also discuss the applicability of the reflective algebra.