Very Computer

I'm looking for the program source of B+-tree for OODB indexing.
I need B+-tree supporting the class-hierarchy indexing.
                          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
And I want to know the structure of leaf node of the B+-tree
used in real OODBMSs (for example, postgres, ORION, etc).
I have read the paper, "Indexing Techniques for Object-Oriented
Databases", written by Won Kim, Kyung-Chang Kim and Alfred Dale
but the leaf node structure described in this paper has a problem
for using it in real DBMS. When inserting and deleting objects
management of leaf node may be very inefficient.

Thanks in advance.

--
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
      * *
       ^ &&& DataBase & Hangul Information Processing Lab, . . .    
                Dept. of Computer Science, Pusan Univ. , Korea

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=