| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: b+ tree implementation question
got it - without a stack, rewrote the recursive insert-function. works
good and fast. next task at hand will be delete(), i guess thats the
most complicated thing...
thanks for your help! Received on Fri Jan 21 2005 - 05:22:01 CST
![]() |
![]() |