The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Practical parallel programming
Practical parallel programming
High-performance sorting on networks of workstations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Object Database Standard: ODMG-93, Release 1.2
Object Database Standard: ODMG-93, Release 1.2
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Parallel Processing of Spatial Joins Using R-trees
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Design of Parallel R-tree on Cluster of Workstations
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
Efficient k-nearest neighbor searches for parallel multidimensional index structures
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An index structure for parallel processing of multidimensional data
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Parallel spatial query processing on GPUs using R-trees
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
| Hi-index | 0.00 |
Though parallel database systems have been extensively studied, as far as we know, the parallel algorithms of R-tree propsed so far are limited to one workstation with multiprocessors or multi disks, where parallel sorting algorithm or concurrent I/O is used to improve the performance.For the search of R-tree, multiple search paths from the root to leaves are traversed sequentially. This sequential traverse can be transformed into multiple parallel traverses based on multiple search paths, where the query is divided into subqueries which can be executed concurrently.In the paper, aiming at parallel I/O and CPU operations, we introduce a parallel R-tree search algorithm running on Distributed Shared Virtual Memory (DSVM), especially on Shusseuo which is an ODBMS providing global persistent object management on persistent DSVM. The related problems are discussed and the evaluations are made based on Shusseuo. Experimental results show that optimal performance can be reached in dealing with large volume of data.