Search. Read. Cite.

Easy to search. Easy to read. Easy to cite with credible sources.

Journal of Engineering and Applied Sciences

Year: 2018  |  Volume: 13  |  Issue: 7 SI  |  Page No.: 5561 - 5564

Querying Scalable and Redundant Data via. Recursive Queries in Orm Systems

Priyadharshini Muthukrishnan, V. Sakthivel, Baskaran Ramachandran, K. Srihari and P. Balaji


Persistent data are stored in database server and is often used than archived data. Most business applications handling large databases contain recursive data and processing such recursive data is difficult. Relational algebra doesn’t provide adequate facility to manipulate such data, even initial SQL too doesn’t, however, it is introduced in SQL: 1999. MySQL an open source database management system doesn’t support recursive query yet. Hibernate being an open source Object Relational Mapping (ORM) tool provides Hibernate Query Language (HQL) for querying databases. Using which recursive queries are executed as HQL with the options provided by the corresponding Data Base Management System (DBMS). In DBMS such as MySQL where recursive query is not possible our proposed extension of hibernate provides the option to execute recursive queries by executing a combination of normal queries in a particular order.