This paper provides a comprehensive treatment of index management in transaction systems. we present a method, called ARIESIIM (Algorithm for recovery and isolation exploiting semantics for index management), for concurrency control and recovery of B+ -tree. ARIES/IM guarantees serializability and uses write-ahead logging for recovery. it supports very high concurrency and good performance by (1) treating as the lock of a key the same lock asthe one on the corresponding record data in a data page (e.g., at the record level), (2) not acquiring, in the interest of permitting very high concurrency,commit duration locks on index pages even during index structure modification operations (SMOs) like page splits and page deletions, and (3) allowing retrievals, inserts, and deletes to go on concurrently with SMOs. during restart recovery, any necessary redos of index changes are always performed in a page-oriented fashion (i.e., without traversing the index tree) and, during normal processing and restart recovery, whenever possible undos are performed in a page-oriented fashion. ARIES/IM permits different granularities of locking to be supported in a flexible manner. a subset of ARIES/IM had been implemented in the OS/2 extended edition database manager. since the locking ideas of ARIES/IM have general applicability, some of them have also been implemented in SQL/DS and the VM shared file system, even thoughthose systems use the shadow use the shadow-page technique for recovery.