Spatial priority search: an access technique for scaleless maps
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Strip trees: a hierarchical representation for curves
Communications of the ACM
On multi-scale display of geometric objects
Data & Knowledge Engineering
An Access Method for Integrating Multi-scale Geometric Data
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Selectivity Estimation of Complex Spatial Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Accurate Estimation of the Cost of Spatial Selections
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Analyzing Range Queries on Spatial Data
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Efficient update and retrieval of objects in a multiresolution geospatial database
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Extensions of GAP-tree and its implementation based on a non-topological data model
International Journal of Geographical Information Science
A multi-resolution model of vector map data for rapid transmission over the Internet
Computers & Geosciences
A multi-layer data representation of trajectories in social networks based on points of interest
Proceedings of the twelfth international workshop on Web information and data management
| Hi-index | 0.00 |
Finding a balance between data redundancy and manipulation efficiency can sometimes be problematic when building multi-scale spatial databases (MSDBs). In order to render MSDBs real-timely, coarser representations with fewer vertices should be invoked once the response time exceeds the tolerable limitation. Of course, this would result in faster response speeds. With the vertex histogram making it possible to simulate the change in the number of vertices queried (NVQ) for the most complex area when the display scale shrinks, a NVQ-based approach is set forward to fix the representations by comparing the NVQ of the most complex area with the tolerable NVQ. This causes the number of levels and definite scales to be determined not only by the dataset itself but also by the generalization method. As a result, the arbitrary appointment of levels or scales when building multi-scale spatial datasets is avoided. It is argued that this approach facilitates the use of fewer representation levels to build a multi-scale database with a reasonable scale-setting scheme. Furthermore, the response time is restricted within the limit set in advance. A case study with a real spatial dataset verifies the effect of the proposed approach.