Reflective programming in the relational algebra (extended abstract)
Summary: Introduces a reflective relational algebra that treats RA programs as first-class relations, enabling generation and integration of query code at runtime. Analyzes expressiveness and complexity, showing reflection corresponds to bounded looping and discussing applicability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,386 | Managing Semantic Heterogeneity in Databases : A Theoretical Perspective | 1997 | PODS | 0.00012251453 |
| 1,508 | Using Schematically Heterogeneous Structures | 1998 | SIGMOD | 0.00011593524 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 353 | Object Identity As A Query Language Primitive | 1989 | SIGMOD | 0.00026275228 |
| 580 | Quel As A Data Type | 1984 | SIGMOD | 0.00019775101 |
| 1,020 | ILOG: Declarative Creation and Manipulation of Object Identifiers | 1990 | VLDB | 0.00014614067 |
| 1,874 | Relations with Relation Names as Arguments: Algebra and Calculus | 1992 | PODS | 0.00010251818 |
| 3,195 | On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions | 1989 | SIGMOD | 7.4052272e-05 |
Previous
Page 1 / 1
Next