Add to ORKG[[abstract]]©2000 Duke University-A concurrency control algorithm (CCA), called KB [7], has been proposed for concurrent operations on R-trees. However, KB does not thoroughly utilize the high-concurrency property of the link technique. In this paper, we propose an efficient link CCA, called CC, which has higher performance than KB does. In our method, a node is locked only when it is being modified, and is released quickly after modification.[[department]]資訊工程學
Multiuser database systems require concurrency control in order to perform correctly. B-trees have b...
Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Ad...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
[[abstract]]©1998 NSC-Locking based concurrency control protocols are added into the access methods ...
Abstract. This paper proposes a new lock-based concurrent binary tree using a methodology for writin...
Locking and unlocking operations are crucial to keep data consistency for concurrency control. Compa...
The concurrent manipulation of a binary search tree is considered in this paper. The systems present...
Building a library of concurrent data structures is an essential way to simplify the difficult task ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
The performance of conventional distributed algorithms does not scale with the network data rate, ow...
In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware p...
[[abstract]]©1993 Institute of Information Science Academia Sinica-TBSAMlink, a variant of TBSAM, is...
ABSTRACT Recently, with the broad usage of location-aware devices, applications with moving object m...
Concurrent data structures provide the means to multi-threaded applications to share data. Typical d...
Multiuser database systems require concurrency control in order to perform correctly. B-trees have b...
Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Ad...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
[[abstract]]©1998 NSC-Locking based concurrency control protocols are added into the access methods ...
Abstract. This paper proposes a new lock-based concurrent binary tree using a methodology for writin...
Locking and unlocking operations are crucial to keep data consistency for concurrency control. Compa...
The concurrent manipulation of a binary search tree is considered in this paper. The systems present...
Building a library of concurrent data structures is an essential way to simplify the difficult task ...
This paper presents general algorithms for concurrency control in tree-based access methods as well ...
The performance of conventional distributed algorithms does not scale with the network data rate, ow...
In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware p...
[[abstract]]©1993 Institute of Information Science Academia Sinica-TBSAMlink, a variant of TBSAM, is...
ABSTRACT Recently, with the broad usage of location-aware devices, applications with moving object m...
Concurrent data structures provide the means to multi-threaded applications to share data. Typical d...
Multiuser database systems require concurrency control in order to perform correctly. B-trees have b...
Before moving beyond locks, we’ll first describe how to use locks in some common data structures. Ad...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...