The Parallel Processing of Spatial Selection for Very Large Geo-Spatial Databases
نویسندگان
چکیده
Earth science (ES) applications handle very large geospatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for geo-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geospatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.
منابع مشابه
Spatial Indexing of Large-Scale Geo-Referenced Point Data on GPGPUs Using Parallel Primitives
Modern positioning and locating technologies, e.g., GPS, have generated huge amounts of geo-referenced point data that are crucial to understand environmental and social-economic phenomena. Unfortunately, traditional disk-resident databases are inefficient in handling large-scale point data. In this study, we propose to utilize the massive data parallel processing power of General Purpose compu...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملA New Method for Detecting Sperms in Microscopy Images: Combination of Zernike Moments and Spatial Processing
Introduction: In recent years, modern microscopic imaging in parallel with digital image processing techniques, have facilitated computerized semen analysis. However, in these methods, distinguishing sperms from other semen particles can be hampered by low contrast of microscopic images and the possibility of neighboring sperms touching each other. Materials and Methods: This article introduced...
متن کاملPFDC: A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases
Clustering – the grouping of objects depending on their spatial proximity – is one important technique of knowledge discovery in spatial databases. One of the proposed algorithms for this is FDC [5], which uses a density-based clustering approach. Since there is a need for parallel processing in very large databases to distribute resource allocation, this paper presents PFDC, a parallel version...
متن کاملTowards Improving Query Performance of Web Feature Services (WFS) for Disaster Response
While OGC’s WFS facilitates disseminating heterogeneous spatial data over the Web and allows feature-level geospatial information sharing and synchronization, performance issues challenge the efficient and effective utilization of WFS for disaster response. Literature shows that obtaining spatial information becomes very slow when querying WFS systems from large geospatial databases over the In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001