A Concurrency Control Method for Non-blocking Search Operation based on R-tree 


Vol. 11,  No. 4, pp. 809-822, Aug.  2004
10.3745/KIPSTD.2004.11.4.809


PDF
  Abstract

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

  Statistics
  Cite this article

[IEEE Style]

M. K. Kim and H. Y. Bae, "A Concurrency Control Method for Non-blocking Search Operation based on R-tree," The KIPS Transactions:PartD, vol. 11, no. 4, pp. 809-822, 2004. DOI: 10.3745/KIPSTD.2004.11.4.809.

[ACM Style]

Myung Keun Kim and Hae Young Bae. 2004. A Concurrency Control Method for Non-blocking Search Operation based on R-tree. The KIPS Transactions:PartD, 11, 4, (2004), 809-822. DOI: 10.3745/KIPSTD.2004.11.4.809.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals