Loading [a11y]/accessibility-menu.js
Processing of Relational Algebra Expressions by the Shunting Yard Algorithm | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 27 January, the IEEE Xplore Author Profile management portal will undergo scheduled maintenance from 9:00-11:00 AM ET (1400-1600 UTC). During this time, access to the portal will be unavailable. We apologize for any inconvenience.

Processing of Relational Algebra Expressions by the Shunting Yard Algorithm


Abstract:

The paper proposes a method of parsing for relational algebra expressions, which is based on the use of reverse Polish notation (postfix notation). The operation algorith...Show More

Abstract:

The paper proposes a method of parsing for relational algebra expressions, which is based on the use of reverse Polish notation (postfix notation). The operation algorithm of the shunting yard, adapted for processing of operators RA, is presented. The tools of lexical analysis and the mechanism of building a syntax analyser for the language of relational algebra are presented. The algorithm of the software solution in Python is described, which allows convert the operator of relational algebra into SQL queries. Underpin of the data source for the implementation of relational algebra operators the relational database - SQLite.
Date of Conference: 17-20 September 2019
Date Added to IEEE Xplore: 12 December 2019
ISBN Information:
Conference Location: Lviv, Ukraine

References

References is not available for this document.