I would like to implement B + tree in Java and try to optimize it for disk-based I / O. Is there an API for accessing individual disk blocks from Java? or is there an API that can perform similar block-oriented access that fits my purpose?
I would like to create something like Tokyo Cabinet in 100% Java. Is there anyone who knows which Java databases, such as JavaDB , are used for this in the background?
I know that there are probably languages ββother than Java that can do this better, but I only do this for training purposes.
source share