TimesTen now supports B-tree indexes. B-tree indexes and T-tree indexes both are referred to as Range Indexes. In some cases, B-tree indexes offer concurrency advantages over T-trees. The RangeIndexType data store connection attribute determines whether user-created range indexes are T-tree indexes or B-tree indexes.
Once RangeIndexType is set to 1 for a datastore then all the range index [Create Index Table_Idx ] will be created as T Tree index for all tables, when set to 0 all the indexes in the datastore will be B* Tree. Can you please throw more light on the advantage and disadvantage of B Tree and T Tree index?
A best practice recommendation is to use B-Tree range indexes with all new TimesTen databases/applications. There's lots of discussion out there on the web on the merits or otherwise of T-Tree and B-Tree indexing. In the context of TimesTen, B-trees supersede T-trees and are far more concurrent for multi-threaded, multi-core, multi-user data access and thus scale a lot better.
Unless you have a legacy TimesTen application with a low number of cores/threads and you want to keep the same access patterns then there's no need to use T-tree range indexes.