An efficient data organization for parallel algorithmic design of cartographic database

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.<
>