Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/42012
Title: R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases
Authors: Mondal, A.
Kitsuregawa, M.
Ooi, B.C. 
Tan, K.L. 
Issue Date: 2001
Source: Mondal, A.,Kitsuregawa, M.,Ooi, B.C.,Tan, K.L. (2001). R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases. Proceedings of the ACM Workshop on Advances in Geographic Information Systems : 28-33. ScholarBank@NUS Repository.
Abstract: In order to provide fast and timely answers to queries in the context of spatial databases and GIS, we present our solution for effective data migration and tuning strategies in shared-nothing parallel spatial databases. Our purpose is to improve the performance of the indexes. Our approach has the following features. First, our scheme is self-tuning, dynamic as well as query-centric and it can adapt to dynamically changing user access patterns. Second, a global distributed R-tree-based indexing method is employed to facilitate effective data migration. Third, unlike traditional partitioning strategies where each processing element (PE) contains data from a single region of space, we allow each PE to store data from multiple and disjoint regions. This minimizes overlap in regions as well as coverage. We implemented the proposed scheme and conducted an extensive performance study on Fujitsu's AP3000 machine with 32 workstations using real datasets. Our experimental results show that our load-balancing strategy can distribute the load effectively across the PEs in the system, thereby reducing response times of incoming queries.
Source Title: Proceedings of the ACM Workshop on Advances in Geographic Information Systems
URI: http://scholarbank.nus.edu.sg/handle/10635/42012
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

105
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.