Java Database Connectivity (JDBC)

Can anyone give me a quick summary of these two ideas?

I'm trying to gather information to compare/contrast these two indexing structures for one of my classes. They were presented as seperate concepts, but I'm getting the impression that maybe a B-Tree is an extension of ISAM.
There was not much information presented on the calculating the performance of each indexing structure for insert/delete/search equal/search range.
I know that B-Tree is the prerable solution with great performance on searches.

So, I'm really looking to create a table which shows side-by-side the peformance characteristics.