A bridging model for parallel computation
Communications of the ACM
Parallel database systems: the future of high performance database systems
Communications of the ACM
BSPlib: The BSP programming library
Parallel Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Parallel R-Tree Search Algorithm on DSVM
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
Master-Client R-Trees: A New Parallel R-Tree Architecture
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
High-Concurrency Locking in R-Trees*
High-Concurrency Locking in R-Trees*
| Hi-index | 0.00 |
R-tree is widely used in indexing of multidimensional and spatial data. When it is used in environment of COW (Cluster Of Workstations), to the best of our knowledge it is used in Master-Slave mode or its variants. Under this mode when an entry is accessed, it must be locked. The higher the locked entry in the R-tree, the more transactions will be stopped from accessing all the offspring of it. Therefore the degree of concurrency is paralyzed. Moreover, the Master will become the hotspot in parallel processing which can worsen the overall performance. In this paper we present an upgraded parallel R-tree model which is suitable for the environment of COW. Our parallel R-tree can not only balance the load among processors but also decrease the conflicts of intra-and inter-transactions. We can successfully prevent the emergence of hot spot from accessing the R-tree. The detailed searching algorithm and the load shipping algorithm of this parallel R-tree are given. Lastly we provide experimental results which show that the parallel R-tree performs well as expected.