R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. Because the data volume of such databases is typically very large, the query operation on R-tree data structure has an important impact on the performance of spatial databases. To boost the performance of R-tree search operations, we propose a new parallel R-tree search algorithm, which utilizes an adjacency matrix representation for an R-tree and performs the search using binary arithmetic among matrix elements. When the algorithm is implemented in hardware, we demonstrate through our simulation that the run-time complexity of the new algorithm is only bounded by the height of an R-tree. Furthermore, we find that the proposed al...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Searching and handling geometric data are basic requirements of any Computer Aided Engineering appli...
This thesis investigates the performance of memory resident spatial search, focusing on the R-tree. ...
R-Trees are popular spatial indexing techniques that have been widely adopted in many geospatial app...
Abstract { Data-parallel algorithms for R-trees, a common spatial data structure arepresented, in th...
R-trees are popular spatial indexing techniques that have been widely used in many geospatial applic...
Many emerging mobile applications require analyzing large spatial datasets. In these applications, e...
Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel ...
We consider the problem of exploiting parallelism to accelerate the performance of spatial access m...
The general purpose computing on graphics processing unit (GP-GPU) has emerged as a new cost effecti...
In this paper we address the problem of indexing spatial data, in particular two dimensional rectang...
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organ...
k-d tree (or Multidimensional binary search tree) is often used as a data structure for organizing a...
The similarity search problem is found in many application domains including computer graphics, info...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Searching and handling geometric data are basic requirements of any Computer Aided Engineering appli...
This thesis investigates the performance of memory resident spatial search, focusing on the R-tree. ...
R-Trees are popular spatial indexing techniques that have been widely adopted in many geospatial app...
Abstract { Data-parallel algorithms for R-trees, a common spatial data structure arepresented, in th...
R-trees are popular spatial indexing techniques that have been widely used in many geospatial applic...
Many emerging mobile applications require analyzing large spatial datasets. In these applications, e...
Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel ...
We consider the problem of exploiting parallelism to accelerate the performance of spatial access m...
The general purpose computing on graphics processing unit (GP-GPU) has emerged as a new cost effecti...
In this paper we address the problem of indexing spatial data, in particular two dimensional rectang...
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organ...
k-d tree (or Multidimensional binary search tree) is often used as a data structure for organizing a...
The similarity search problem is found in many application domains including computer graphics, info...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Searching and handling geometric data are basic requirements of any Computer Aided Engineering appli...