Efficient implementation of recursive queries in major object relational mapping systems

11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The following paper presents the effects of combining two technologies: object-relational mapping and SQL's recursive queries. Both technologies are widely used in modern software, and yet, modern ORM systems still lack the support for recursive database querying. The currently used methods for querying graph and hierarchical structures are either inefficient, difficult to maintain, or do not allow for any portability. The authors of the following paper propose extensions to the general functionality of modern ORM systems and present the results for two ORM systems: Hibernate for Java and Django-models for Python. With this extension programmers using one of those systems can benefit from the support for the recursive queries offered by various object-relational database management systems and write a maintainable code compliant with the used ORM standard. The proposed solution works with IBM DB2, Oracle and PostgreSQL DBMS and proved to be many times faster than the approaches currently used. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Szumowska, A., Burzańska, M., Wiśniewski, P., & Stencel, K. (2011). Efficient implementation of recursive queries in major object relational mapping systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7105 LNCS, pp. 78–89). https://doi.org/10.1007/978-3-642-27142-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free