Concurrency control for B-trees with differential indices

Author

Pollari-Malmi, Kerttu ; Ruuth, Jarmo ; Soisalon-Soininen, Eljas

Author_Institution

Dept. of Comput. Sci. & Eng., Helsinki Univ. of Technol., Espoo, Finland

fYear

2000

fDate

2000

Firstpage

287

Lastpage

295

Abstract

We present an indexing system where a database index is divided into two parts: the main index located on disk and the differential index in the main memory. Both indices are implemented as B-trees. All updates performed by active transactions are written in the differential index. Periodically, writes of committed transactions are transferred from differential index to the main index as a batch-update operation. Thus, updates falling into the same leaf of the tree can be performed simultaneously. In addition, the system offers a simple recovery scheme. After a system crash, no undo operations are needed and redo operations need only write to the main memory

Keywords

concurrency control; database indexing; database theory; system recovery; transaction processing; tree data structures; trees (mathematics); B-trees; active transactions; batch-update operation; committed transactions; concurrency control; database index; differential index; differential indices; indexing system; main index; main memory; redo operations; simple recovery scheme; system crash; undo operations; updates; Computer crashes; Computer science; Concurrency control; Data engineering; Data warehouses; Indexing; Information technology; Solids; Tiles; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Database Engineering and Applications Symposium, 2000 International

Conference_Location

Yokohama

Print_ISBN

0-7695-0789-1

Type

conf

DOI

10.1109/IDEAS.2000.880589

Filename

880589