Abstract
It is becoming increasingly important that a Geographical Information System delivers high performance to efficiently store, retrieve and process the voluminous data that it needs to handle. It is necessary to employ processing and storage parallelism for scalable long‐term solutions. With the demise of many custom‐built parallel machines, it is imperative that we use off‐the‐shelf technology to provide this parallelism. A closely‐coupled network of workstations is a viable alternative. This paper shows that a distributed index structure spanning the workstations can provide an efficient shared storage structure that can be used to get to the geographic information distributed amongst the individual disks and memories of the workstations. This goal can be attained without significantly compromising on the time taken to build this structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. An, R. Lu, L. Qian, A. Sivasubramaniam and T. Keefe, Storing spatial data on a network of workstations, Technical Report CSE-99-005, Department of Computer Science and Engineering, The Pennsylvania State University (June 1999).
N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM-SIGMOD Conference (June 1990) pp. 322-331.
J.L. Bentley, Multidimensional binary search trees used for associative searching, CACM 18(9) (1975) 509-517.
N.J. Boden et al., Myrinet: A gigabit-per-second local area network, IEEE Micro 15(1) (1995) 29-36.
P.A. Boncz, W. Quak and M.L. Kersten, Monet and its geographic extensions: A novel approach to high performance GIS processing, in: EDBT (1996) pp. 147-166.
M. Coyle, S. Shekhar and Y. Zhou, Evaluation of disk allocation methods for parallelizing spatial queries on grid files, Journal of Computer and Software Engineering, to appear.
R.A. Finkel and J.L. Bentley, Quad trees — a data structure for retrieval on composite keys, Acta Informatica 4 (1974) pp. 1-9.
M. Freeston, The bang file: a new kind of grid file, in: Proceedings of the 1987 ACM-SIGMOD Conference (May 1987) pp. 260-269.
X. Fu, D. Wang, W. Zheng and M. Sheng, GPR-Tree: A global parallel index structure for multiattribute declustering on cluster of workstations, in: Proceedings of the 1997 Conference on Advances in Parallel and Distributed Computing, Shanghai, China (March 1997) pp. 300-306.
S. Ghandeharizadeh, D.J. WeWitt and W. Qureshi, A performance analysis of alternative multiattribute declustering strategies, in: Proceedings of 1992 ACM-SIGMOD Conference (June 1992).
0. Gunther, The design of the cell tree: An object-oriented index structure for geometric databases, in: Proceedings of the 5th International Conference on Data Engineering, Los Angeles, CA (February 1989) pp. 598-605.
A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM-SIGMOD Conference, Boston, MA (June 1984) pp. 47-57.
K. Hinrichs and J. Nievergelt, The grid file: a data structure to support proximity queries on spatial objects, in: Proceedings of the WG'83 Intern. Workshop on Graph Theoretic Concepts in Computer Science (1983) pp. 100-113.
I. Kamel and C. Faloutsos, Parallel R-Trees, in: Proceedings of the 1992 ACM-SIGMOD Conference, CA (June 1992) pp. 195-204.
N. Koudas, C. Faloutsos and I. Kamel, Declustering spatial databases on a multi-computer architecture, in: EDBT, Avignon, France (March 1996) pp. 592-614.
D.B. Lomet and B. Salzberg, The hB-tree: A multiattribute indexing method with good guaranteed performance, ACM Transactions on Database Systems 15(4) (December 1998) 625-658.
R.W. Marx, The TIGER system: Automating the geographic structure of the United States Census, Government Publications Review 13 (1986) 181-201.
J. Patel et al., Building a scalable geo-spatial DBMS: Technology, implementation, and evaluation, in: Proceedings of the 1997 ACM-SIGMOD Conference (June 1997) pp. 336-347.
J.M. Patel, Efficient database support for spatial applications, Ph.D. thesis, University of Wisconsin-Madison, 1998.
J.T. Robinson, The k-d-b-tree: a search structure for large multidimensional dynamic indexes, in: Proceedings of the 1981 ACM-SIGMOD Conference (1981) pp. 10-18.
H. Samet, The Design and Analysis of Spatial Data Structures, (Addison-Wesley, Reading, MA, 1989).
B. Schnitzer and S.T. Leutenegger, Master-client R-trees: A new parallel R-tree architecture, Technical Report COMP.98.01, University of Denver, 1998.
S. Shekhar et al., Declustering and load-balancing methods for parallelizing geographic information systems, IEEE Transactions on Knowledge and Data Engineering 10(4) (1998) 632-655.
S. Shekhar et al., Parallelizing a GIS on a shared address space architecture, IEEE Computer (1996).
Special issue on parallel processing in GIS, International Journal of Geographical Information Systems 10(6) (1996).
T. von Eicken, A. Basu, V. Buch and W. Vogels, U-Net: A user-level network interface for parallel and distributed computing, in: Proceedings of the 15th ACM Symposium on Operating System Principles (December 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
An, N., Lu, R., Qian, L. et al. Storing spatial data on a network of workstations. Cluster Computing 2, 259–270 (1999). https://doi.org/10.1023/A:1019047229571
Issue Date:
DOI: https://doi.org/10.1023/A:1019047229571