Abstract—Relational database systems have succeeded commercially because of their openness and sturdy theoretical groundwork. The contribution of this title “Relational Algebra Interpreter in context of query languages” is presentation of new implementation in such a way so that queries written in relational algebra can be compiled into SQL and executed on a relational database system. It takes a relational algebra statement as key, does syntactic and lexical parsing on it. In the event of an error in the syntax of the expression it will forward the error to user. If the syntax is correct the relational algebra expression is converted into a SQL statement and executed on an RDBMS. This work can serve up as a basis learning Relational Algebra for different class of users, as they will be given immediate feedbacks about their queries.
Index Terms—Relational Algebra; structured query language; parser; interpreter
Anshu Ranjan, Computer Information Science and Engineering, University of Florida, Gainesville, USA (email: firstname.lastname@example.org).
Ratnesh Litoriya , Computer Science and Engineering , Jaypee Institute of Engineering and Technology, Guna, India (email: email@example.com).
Cite: Anshu Ranjan, Ratnesh Litoriya, "Relational Algebra Interpreter in Context of Query Languages," International Journal of Computer Theory and Engineering vol. 3, no. 1, pp. 9-15, 2011.