Concurrent Operations in Large Ordered Indexes

In t h i s paper we p r e s e n t a new s o l u t i o n to the problem o f s u p p o r t i n g c o n c u r r e n t o p e r a t i o n s in B t r e e s , us ing a t e c h n i q u e c a l l e d s i d e b r a n c h i n g to p r o v i d e a h i g h e r degree o f c o n c u r r e n c y than p r e v i o u s s o l u t i o n s i n the same c a t e g o r y . We a lso propose a new data s t r u c t u r e , T t r e e s , as an a l t e r n a t i v e to B t r e e s f o r r e p r e s e n t i n g ve ry l a r g e o rde red indexes i n database a p p l i c a t i o n s . A T t r e e o f f e r s not o n l y an e l e g a n t s t r u c t u r e f o r s t o r i n g a huge amount o f da ta , i t a l so p e r m i t s a c o n s i s t e n t v iew and u n i f o r m t r e a t m e n t o f c o n c u r r e n c y a t both the page t r e e and the page node l e v e l s .