This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.
I need to implement an index for a database that stores objects in XML. I will be using the database to store thousands of objects. I need a b-tree in Java that doesn't keep all of its nodes in memory, but that can walk through nodes that are stored in XML format.
Does anything like this exist?
Can you point me to an example of a B-Tree that is open source and well documented?