|
|
|
@inproceedings{DBLP:conf/dasfaa/WangHKM99,
author = {Botao Wang and
Hiroyuki Horinokuchi and
Kunihiko Kaneko and
Akifumi Makinouchi},
editor = {Arbee L. P. Chen and
Frederick H. Lochovsky},
title = {Parallel R-Tree Search Algorithm on DSVM},
booktitle = {Database Systems for Advanced Applications, Proceedings of the
Sixth International Conference on Database Systems for Advanced
Applications (DASFAA), April 19-21, Hsinchu, Taiwan},
publisher = {IEEE Computer Society},
year = {1999},
isbn = {0-7695-0084-6},
pages = {237-245},
ee = {db/conf/dasfaa/WangHKM99.html},
crossref = {DBLP:conf/dasfaa/99},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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.
Copyright © 1999 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.
