A Concurrency Control Scheme over T-tree in Main Memory Databases with Multiversion

  • Ying Xia (Dept. of Computer Science & Engineerting, Inha University) ;
  • Cho, Sook-Kyoung (Dept. of Computer Science & Engineerting, Inha University) ;
  • Oh, Young-Hwan (Dept. of Computer Science & Engineerting, Inha University) ;
  • Kim, June (Dept. of Internet Service, Computer & Software Technology Lab.,ETRI) ;
  • Bae, Hae-Young (Dept. of Computer Science & Engineerting, Inha University)
  • Published : 2000.10.01

Abstract

In this paper, we present a comcurrency control scheme over the index structure in main memory databases using multiversion mechanism, and implement it on T-tree. As a well-known idea for comcurrency control, multiversion allows multiple transactions to reat and write different versions of the same data item, each transaction sees a consistent set of versions for all the data items it accesses[1]. Logical versioning and physical versioning techniques are used to keep versions of data item and versions of index node respectively. The main features of this multiversion indexing approach are (1)update operations and rotations on T-tree can take place concurrently, (2)the number of locking and latching requirement is sharply reduced because read-only transactions do not obtain any locks or latches and update transactions obtain latches only when actually performing the update, (3)it reduces storage overhead for tracking version and reclaims storage in time, and (4)it provides complete isolation of read-only transactions from update transactions, so the read-only transactions can get response information without any block.

Keywords