Programming Dissertation: Efficiency Analysis of Object-Relational Mapping Tools in JAVA

In Brief

  • In the modern period of enterprise Web technology, there is robust competition mounting between different vendors for highly scalable and reliable Web application frameworks.
  • The study delivers information about the tools’ functionalities and also relates the results of numerous queries we have designed to test their performance.
  • This study offers computer scientists and developers who are primarily interested in database driven applications to get an entire idea of what type of persistence tools are accessible and what features they propose.

Introduction

Object Persistence is well-defined as the reposition of the objects later the execution of the program. An object-oriented language like Java arranges for different persistence storage systems that run mechanisms for preserving the data. Some of the frequently used persistence mechanisms are used for enduring the data that comprises Java serialization, Enterprise Java Beans (EJB) and Java Persistence API (JPA). These mechanisms let the data to be deposited in the files or they can be kept in a database system.

There are some Java persistent storage systems that offer a solution to this incompatibility problem. These systems provide diverse techniques for representing the domain model to the relational database. These systems also provide other features like transaction management, query languages and caching mechanisms. This study is dedicated to performance evaluation between various persistent storage systems and our tradition designed persistent storage system. This article is suitable for someone seeking Java Programming Dissertation help.

SEE ALSO: How to identify the right programming language for dissertation writing?

Object Relational Mapping in relation to Object Database

Object-relational mapping is a procedure that is used for mapping Java objects to a group of interconnected tuples for storage in a relational database. The class metadata for a Java object is developed to determine the mapping.

This study was performed to illustrate the practice and performance of an object database in comparison with ORM tools. The tools that are preferred for this comparison are Versant ODBMS and the Hibernate. There are three areas that are opting for the comparison. The first area matches the features of the tools precisely. They provide tabular data in which various features of each of the tools were discoursed namely scalability, reliability and extendibility. The second area confers the relationship between different features like object-relational mapping, transaction management, caching mechanism and query languages. The third and most crucial area of comparison is how these tools accomplish. In this assessment, they use the OO7 benchmark in which they execute different tests for CRUD1 operations whereas CRUD stands for Create, Retrieve, Update and Delete.

ORM Paradigm Discrepancy Problems

Before the ORM techniques were presented, there were some complications in mapping objects to tuples in a relational database. This section defines the different ORM mismatch difficulties that are present before useful tools like Hibernate became accessible.

Problem of granularity– Java developers can spontaneously define new classes with various levels of granularity. The finer-grained classes such as Address class, can be inserted into coarse-grained classes, like User class. However, the type system for relational databases is restricted and the granularity can be implemented simply at two levels: the table level (User table) and the column level (Address column).

Useful Blog: Dissertation writing Support in Advanced Python Coding & Algorithm

Problem of subtypes– Inheritance is a broadly used feature of the Java programming language that obscures object-relational mapping. Relational databases usually do not wholly support type or table inheritance and if they support it, they do not monitor standard syntax. For instance, PostgreSQL presently supports inheritance named as table Inheritance. Inheritance is not acclaimed to use, because it does not support inheritance of foreign key constraint and indexes. 

Problem of identity– The character of a database row is articulated as the primary key. Thus each tuple in database table characterizes a unique record. At the object level it is not constantly the case. It is possible that two different objects having the same features values can be acknowledged as being equal with the equals () function. Likewise the objects can be related using the (==) operator.

Problems concerning to associations– In the domain model, associations exemplify relationships between entities and are employed for navigation. The Java language signifies associations with object references, but the associations in relational databases are symbolized through the use of foreign keys.

Problem of data navigation– Retrieving data and navigating from one object to another is poles apart in Java and in relational databases. The associations between objects can be unidirectional or bidirectional as conversed. Calling up data in Java ensues by navigating between objects through getter methods, e.g., getName(). Getting into data from the relational database and navigating from one table to another with SQL necessitates connections between tables and performance of the queries can be enhanced by diminishing the number of request to database.

Sorts of Mapping in ORM

Entity Mapping -An entity is a lightweight insistent domain object. An entity class draws to a table in a database and each instance of the entity corresponds to a tuple in that table. Every entity must have an identifier, which recognizes that entity. The identifier can be used on a single field or its composite fields. The JPA specification comprises different techniques for mapping. We can employ annotations or the Xtensible Markup Language (XML) mapping files to describe mappings.

 Inheritance Mapping

The inheritance mapping, as the name suggests, deals with the mapping of inheritance that is defined at the object level. There are three basic types of inheritance techniques that are used to map to database schema. 

Navigation Mapping– Navigation between objects in the domain model is defined based on directionality. There are two types of navigations.

Unidirectional Navigation– In this type of navigation, an object from only one side of association can navigate to an object on the other side, but navigation in the other direction is not supported.

Bidirectional Navigation-In this type of navigation, an object on either side of association can navigate to the other object. In this way the developer has more flexibility to link two objects from either side of the association.

Association Mapping -An association A on class C and D pairs objects from C with objects from D. Associations can be defined as the simple association between two classes or it can be used as the aggregation between the classes.

Conclusion

This section gives the conclusions for this performance study. All of the persistence storage systems that we have tested provide different features with their own pros and cons. As this study basically focuses on how each system performs while retrieving the data, it is important to focus on the factors such as cache management, query language and the ORM features that these tools have. Thus, we can conclude that no system is designed perfectly and all the system needs improvement on one feature or the other. We offer the best programming thesis help online.

Reference

  1. Ireland, C., Bowers, D., Newton, M., & Waugh, K. (2009, March). A classification of object-relational impedance mismatch. In 2009 First International Conference on Advances in Databases, Knowledge, and Data Applications (pp. 36-43). IEEE.
  2. Torres, A., Galante, R., Pimenta, M. S., & Martins, A. J. B. (2017). Twenty years of object-relational mapping: A survey on patterns, solutions, and their implications on application design. information and software technology82, 1-18.

Comments are closed.