An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures

An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures

Seok Il Song (Chungju National University, Korea) and Jae Soo Yoo (Chungju National University, Korea)
Copyright: © 2006 |Pages: 24
DOI: 10.4018/978-1-59140-935-9.ch014
OnDemand PDF Download:
$37.50

Abstract

This chapter introduces a concurrency control algorithm based on link-technique for high-dimensional index structures. In high-dimensional index structures, search operations are generally more frequent than insert or delete operations and need to access many more nodes than those in other index structures, such as B+-tree, B-tree, hashing techniques, and so on, due to the properties of queries. This chapter proposed an algorithm that minimizes the delay of search operations in all cases. The proposed algorithm also supports concurrency control on reinsert operations for the high-dimensional index structures employing reinsert operations to improve their performance. The authors hope that this chapter will give helpful information for studying multidimensional index structures and their concurrency control problems to researchers.

Complete Chapter List

Search this Book:
Reset