How can I store a persistent index?
I am trying to index a database consisting of about 12 CSV tables in a relational database structure. I am still in the process of getting the open CSV sample code to work (see this thread).
My question is, how can I index these tables for fast record lookup AND store this index on the hard disk so that it would be persistent across program restarts?
For example, let us say that I wanted to index a table of users across the field "user_name". If I were to make this index with a B+ tree (which is roughly what I am working to implement), how could I store this B+ tree so that it did not have to be recalculated every time the program restarted?
I would prefer an explanation of a storage procedure for a number of abstract objects (in my case nodes) in some kind of a structure. Is XML a good way to do this? If so, does anyone have any suggestions on how to implement a B+ tree with XML as the storage solution?