Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
The X-tree: an index structure for high-dimensional data
Readings in multimedia computing and networking
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Integrating the UB-Tree into a Database System Kernel
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Giggle: a framework for constructing scalable replica location services
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Replica Selection in the Globus Data Grid
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Iteration Aware Prefetching for Remote Data Access
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Iteration aware prefetching for large multidimensional datasets
SSDBM'2005 Proceedings of the 17th international conference on Scientific and statistical database management
Servicing range queries on multidimensional datasets with partial replicas
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
UDT: UDP-based data transfer for high-speed wide area networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Spatial indexing in microsoft SQL server 2008
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Concurrency and Computation: Practice & Experience - Grids and Geospatial Information Systems
The Globus Replica Location Service: Design and Experience
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper describes a design and implementation of a distributed high-performance partial spatial replica location service. Our replica location service identifies the set of partial replicas that intersect with a region of interest, an important component of partial spatial replica selection. We find that using an R-Tree data structure is superior to relying on a relational database alone when handling spatial data queries. We have also added a collection of optimizations that together improve performance. In particular, database Query Aggregation and using a Morton curve during R-tree construction produce significant performance gains. Experimental results show that the proposed partial spatial replica location service scales well for multi-client and distributed large spatial queries, queries that return more than 10,000 replicas. Individual servers with one million pieces of replica metadata in the backend database can support up to 100 clients concurrently when handling large spatial queries. Our previous work solved the same problem using an unmodified Globus Toolkit, but the work described here modifies and extends existing Globus Toolkit code to handle spatial metadata operations.