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
Research issues in spatial databases
ACM SIGMOD Record - Directions for future database research & development
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
A Web-based browsing and spatial analysis system for regional natural resource analysis and mapping
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
A systematic approach to reduction of user-perceived response time for GIS web services
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
| Hi-index | 0.00 |
This paper has proposed a new method of efficient spatial data transmission in the client-side Web-Based GIS (Geographic Information System) which handles large-size spatial geographic information on the Internet. The basic idea is that, firstly, a largesize map is divided into several parts, where each part is called a “Tile”, according to appropriate division granularity. Secondly, when an user requires a certain region in the map at client side, the GIS server only transmits spatial data in the tiles which overlap with the requested region. And the received data are stored in client local machine for reuse. Here a method of tile-division and tile-query processing has been provided. Comparing with traditional client-side Web-Based GIS, the performance improvement is achieved by the usage of the proposed method.