How to Optimize a Red Black Tree for Faster Retrieval

We previously said that red black trees were automized for batch inserts. So i didn't completely scrol that up. An a v l trees are typicall use the data bases where faster retrievals are required. We're willing to do that extra work in order to get a little bit faster retrieval yet. And once you've reached some sort of pre defined side pical, then you can dump that data from memory a two disk into a new ss table. This is basicly a fast igestion mechanism and then we dump it out to thet s sa table as necessary.