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

non unique(or duplicate) b+tree collection 기능 검토 #481

Open

minkikim89 opened this issue Aug 5, 2020 · 0 comments

Contributor

minkikim89 commented Aug 5, 2020

현재 b+tree collection은 unique b+tree이다.

응용에서 unique bkey 생성하기 위한 노력이 많이 든다.
이를 해소하기 위해, non unique b+tree collection 기능 개발이 요구된다.

동일한 bkey가 존재할 수 있다.
동일한 bkey 존재하는 경우, element 저장 순서는 value 값의 대소 비교에 따른다.

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