Andrews, Alanoly J., Lakshmanan, Laks V.S., Shiri, Nematollaah, and Subramanian, Iyer N. On implementing advanced database programming languages. Technical Report TR-DB-96-04, Concordia University, Montreal, Quebec, April 1996.  Home/Search   Document Not in Database   Summary   Related Articles

....6. Conclusions and a comparison with some related implementations are given in Section 7. For lack of space, details of some of our algorithms as well as many additional examples illustrating features of SchemaLog and the extended algebra are not included in this paper. Readers may refer to [ALSS96] for the details. 2 Algebra Our approach to the implementation of SchemaLog is based on compiling constructs in SchemaLog into corresponding operations in an extended version of relational algebra, called Schema Algebra, or SA for short. Our algebra includes conventional relational algebra as a ....

....the RGT of a program can be easily adapted to our setting. An important consequence of the fact that SchemaLog unification is performed on atoms is that we need to atomize a SchemaLog program (which in general might contain molecules) before applying the topdown algorithm.We refer the reader to [ALSS96] for the details of the algorithm for atomization. The major strength of SchemaLog lies in its ability to express novel querying as well as powerful restructuring operations. Our adaptation of the classical RGT evaluation algorithm accounts for these unique features of SchemaLog . In the ....

[Article contains additional citation context not shown here]

Andrews, Alanoly J., Lakshmanan, Laks V.S., Shiri, Nematollaah, and Subramanian, Iyer N. On implementing advanced database programming languages. Technical Report TR-DB-96-04, Concordia University, Montreal, Quebec, April 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC