New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

refactor: N + 1 문제를 해결한다 #26

Open

1 task

dongho108 opened this issue Feb 25, 2023 · 0 comments

Assignees

Collaborator

dongho108 commented Feb 25, 2023

As-is

OneToMany EAGER, ManyToOne Lazy 등등 에서 발생하는 N + 1 문제가 있습니다.

To-be

OneToMany EAGER, ManyToOne Lazy 등등 에서 발생하는 N + 1 문제 해결

dongho108 assigned dongho108 and ssssujini99

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment