Efficient structures for geometric data management
Efficient structures for geometric data management
Spatial priority search: an access technique for scaleless maps
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Reactive data structures for geographic information systems
Reactive data structures for geographic information systems
Progressive vector transmission
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Strip trees: a hierarchical representation for curves
Communications of the ACM
Simultaneous Graphic Generalization of Vector Data Sets
Geoinformatica
Spatial Indexing with a Scale Dimension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Multi-agent Systems for Web-Based Map Information Retrieval
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Topologically-Consistent Map Generalisation Procedures and Multi-scale Spatial Databases
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Multiresolution amalgamation: dynamic spatial data cube generation
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Semantic caching for multiresolution spatial query processing in mobile environments
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
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 |
The need to access spatial data at multiple levels of detail is a fundamental requirement of many applications of geographical information, yet conventional spatial database access methods are based on single resolution spatial objects. In this paper we present a design for multi-scale spatial objects in which both spatial objects and the vertices of their component geometry are labelled with scale priority values. Alternative approaches to database implementation are considered in which vertices are organised into scale-bounded layers. Access times for spatially-indexed vertex block schemes (comparable to the PR-File) were superior to a BLOB scheme where only entire multi-scale objects were spatially indexed. The use of a 3D R-tree to integrate scale and space indexing was found to improve considerably on using either R-Tree indexing of space only or B-tree indexing of scale. Techniques are also presented for client-side reconstruction of cached multi-scale geometry. Implementations are compared in a client-server environment using the Informix object relational database system.