Title :
An efficient data organization for parallel algorithmic design of cartographic database
Author :
Dasgupta, R. ; Bhattacharya, S.
Author_Institution :
Dept. of Comput. Sci., Calcutta Univ., India
Abstract :
Summary form only given. The authors propose an efficient data organization for the storage and subsequent retrieval of large volume of cartographic data. The concept of address squares has been used extensively. The inherent parallelism in the data has been explored in order to improve computational efficiency. Several parallel algorithms related to the analysis of the cartographic data based on the proposed data organisation, have also been presented
Keywords :
cartography; database management systems; geographic information systems; address squares; cartographic data; cartographic database; computational efficiency; parallel algorithms; Algorithm design and analysis; Computer science; Data mining; Geographic Information Systems; Geometry; Information analysis; Information retrieval; Parallel algorithms; Shape measurement; Spatial databases;
Conference_Titel :
Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-2295-4
DOI :
10.1109/PDIS.1991.183098
