Skip to main content

What is Difference between JpaRepository and CrudRepository in Spring Data JPA

What is Difference between JpaRepository and CrudRepository?

CrudRepository :-

  • CrudRepository provides mainly CRUD (Create, Read, Update and Delete) operation. 
  • The CrudRepository interface provides methods for CRUD operations, so it allows you to create, read, update and delete records without having to define your own methods.
  • Interface for generic CRUD operations on a repository for a specific type.
  • CrudRepository is base interface and extends the Repository interface.

public interface CrudRepository<T, ID> extends Repository<T, ID>

JpaRepository :-

  • JpaRepository provides CRUD operation as well as provides JPA related methods such as flushing the persistence context and delete records in a batch.
  • JpaRepository extends PagingAndSortingRepository which in turn extends CrudRepository.
  • JpaRepository add some more functionality that is specific to JPA.
  • The PagingAndSortingRepository provides additional methods to retrieve entities using pagination and sorting. 

public interface JpaRepository<T, ID> extends PagingAndSortingRepository<T, ID>, QueryByExampleExecutor<T>

Difference between JpaRepository and CrudRepository


When to use CrudRepository or JpaRepository?

  • CrudRepository mainly provides CRUD operations.
  • PagingAndSortingRepository provides methods to do pagination and sorting data.
  • JpaRepository provides some JPA related methods such as flushing the persistence context and deleting records in a batch.

Because of the above inheritance, JpaRepository will have all the functions of CrudRepository and  PagingAndSortingRepository.

So use JpaRepository if you want to use methods provided by JpaRepository and  PagingAndSortingRepository.

If you want to simple CRUD operation in application then use CrudRepository.

 

Image Source :-

https://www.javatpoint.com/spring-boot-crud-operations

HackerRank Solutions in Java :-

 


Comments

Post a Comment

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st
Post a Comment
Read more

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last
Post a Comment
Read more