首页> 外文会议>International conference on digital information management >Spatial access method for urban geospatial database management: An efficient approach of 3D vector data clustering technique
【24h】

Spatial access method for urban geospatial database management: An efficient approach of 3D vector data clustering technique

机译:城市地理空间数据库管理的空间访问方法:3D矢量数据聚类技术的有效方法

获取原文

摘要

In the last few years, 3D urban data and its information are rapidly increased due to the growth of urban area and urbanization phenomenon. These datasets are then maintain and manage in 3D spatial database system. However, performance deterioration is likely to happen due to the massiveness of 3D datasets. As a solution, 3D spatial index structure is used as a booster to increase the performance of data retrieval. In commercial database, commonly and widely used index structure for 3D spatial database is 3D R-Tree. This is due to its simplicity and promising method in handling spatial data. However, 3D R-Tree produces serious overlapping among nodes. The overlapping factor is important for an efficient 3D R-Tree to avoid replicated data entry in a different node. Thus, an efficient and reliable method is required to reduce the overlapping nodes in 3D R-Tree nodes. In this paper, we proposed a 3D geospatial data clustering to be used in the construction of 3D R-Tree and respectively could reduce the overlapping among nodes. The proposed method is tested on 3D urban dataset for the application of urban infill development. By using several cases of data updating operations such as building infill, building demolition and building modification, the proposed method indicates that the percentage of overlapping coverage among nodes is reduced compared with other existing approaches.
机译:在过去的几年中,由于城市面积的增长和城市化现象,3D城市数据及其信息迅速增加。然后,这些数据集将在3D空间数据库系统中进行维护和管理。但是,由于3D数据集的庞大性,性能可能会发生下降。作为解决方案,将3D空间索引结构用作增强程序,以提高数据检索的性能。在商业数据库中,用于3D空间数据库的常用索引结构是3D R-Tree。这是由于其简单性以及在处理空间数据方面很有前途的方法。但是,3D R-Tree在节点之间产生了严重的重叠。重叠因子对于有效的3D R-Tree避免在不同节点中复制数据条目非常重要。因此,需要一种有效且可靠的方法来减少3D R-Tree节点中的重叠节点。在本文中,我们提出了一种3D地理空间数据聚类,用于3D R-Tree的构建,并且可以减少节点之间的重叠。将该方法在3D城市数据集上进行了测试,以用于城市填充开发。通过使用诸如建筑物填充,建筑物拆除和建筑物修改之类的数据更新操作的几种情况,所提出的方法表明,与其他现有方法相比,节点之间的重叠覆盖率降低了。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号