PARALLEL RANGE QUERY PROCESS METHOD ON R-TREE WITH GRAPHICS PROCESSING UNITS

摘要

PURPOSE: A processing parallel method of range query in R-tree is provided to improve search performance in an R-tree by using a GPU memory as a buffer and performing a search using GPU processors. CONSTITUTION: Queries that have been performed are stored and the entries of the terminal nodes that the query has visited are stored into a GPU memory. A search is executed simultaneously by an R-tree and the GPU when the next query is performed. The next query is performed at a Q R-tee(301) first, and then the region overlapped with the previous queries is checked. If there is an overlapped region, a parallel search is performed by the GPU after finding the first position and end position of GPU_table based on start_index and offset of two nodes.