Welcome to the InfoSci Platform
Reference Hub2
An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures

An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures

Seok Il Song, Jae Soo Yoo
Copyright: © 2004 |Volume: 15 |Issue: 3 |Pages: 13
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200573|EISSN: 1533-8010|DOI: 10.4018/jdm.2004070104
Cite Article Cite Article

MLA

Song, Seok Il, and Jae Soo Yoo. "An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures." JDM vol.15, no.3 2004: pp.60-72. http://doi.org/10.4018/jdm.2004070104

APA

Song, S. I. & Yoo, J. S. (2004). An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures. Journal of Database Management (JDM), 15(3), 60-72. http://doi.org/10.4018/jdm.2004070104

Chicago

Song, Seok Il, and Jae Soo Yoo. "An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures," Journal of Database Management (JDM) 15, no.3: 60-72. http://doi.org/10.4018/jdm.2004070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, we propose 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 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. In the proposed algorithm, we focus on minimizing the delay of search operations in all cases. It also supports concurrency control on reinsert operations for the high-dimensional index structures employing reinsert operations to improve their performance. We apply the algorithm to one of the exiting multi-dimensional index structures and implement it on a storage system. It is shown through various experiments that the proposed algorithm is more suitable for high dimensional index structures than existing ones.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.