You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Feb 8, 2024. It is now read-only.
LDR currently uses B tree data structure to organized the object storage which has logB N (where B is block size and N is number of nodes ) time complexity for insertion and querying. As, to provide more efficiency sand better performance of LDR to customer, it is required to adapt better data structure which can provide enhancement over B tree. So, Bε-tree is a write-optimized data structure which can reduce the cost of B tree. The objective of this task is to compare B tree and Bε-tree and check the feasibility and performance with LDR.