| 注册
首页|期刊导航|重庆邮电学院学报(自然科学版)|An Index mechanism for multi-scale view in spatial databases

An Index mechanism for multi-scale view in spatial databases

ZHANG Yuan-zhi XIE Kun-qing MA Xiu-jun LI Chen-yu CHEN Zhuo

重庆邮电学院学报(自然科学版)2004,Vol.16Issue(5):16-22,7.
重庆邮电学院学报(自然科学版)2004,Vol.16Issue(5):16-22,7.

An Index mechanism for multi-scale view in spatial databases

An Index mechanism for multi-scale view in spatial databases

ZHANG Yuan-zhi 1XIE Kun-qing 2MA Xiu-jun 2LI Chen-yu 2CHEN Zhuo3

作者信息

  • 1. Department of Computer Science, Peking University, Beijing 100871,P. R. China
  • 2. Department of Intelligence Science, Peking University, Beijing 100871,P. R. China
  • 3. Beijing Institute of Surveying and Mapping, Beijing 100038,P. R. China
  • 折叠

摘要

Abstract

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.

关键词

multi-scale/R-tree/visualization/selection/simplification

Key words

multi-scale/R-tree/visualization/selection/simplification

分类

信息技术与安全科学

引用本文复制引用

ZHANG Yuan-zhi,XIE Kun-qing,MA Xiu-jun,LI Chen-yu,CHEN Zhuo..An Index mechanism for multi-scale view in spatial databases[J].重庆邮电学院学报(自然科学版),2004,16(5):16-22,7.

基金项目

This work is supported by the Major Project of National Natural Science Foundation (40235056) and the Major Project of Natural Science Foundation of Beijing (4011002). (40235056)

重庆邮电学院学报(自然科学版)

OACSTPCD

1673-825X

访问量1
|
下载量0
段落导航相关论文