【24h】

Exerting spatial join and KNN queries on spatial database

机译:在空间数据库上执行空间联接和KNN查询

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Spatial database system as a database system that offers spatial data types in its data model and query language and supports spatial data types in its implementation, providing at least spatial indexing and spatial join methods. Spatial database applications, such as Geographical Information Systems (GIS), typically use R-tree variants to index geographical data. Spatial Joins are important operations in applications such as GIS, Cartography and CAD/CAM. Spatial Join is very useful technique for wide spread implementation of R-trees as Spatial index structures. Proposed an algorithm based on R-tree to perform the operation of spatial join for spatial objects in multi-user environment. K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query point. Quickly executing k-Nearest-Neighbor (kNN) in spatial database applications requires an informative and efficient index structure that can effectively reduce the search space. Proposed method implements extension to R-trees that uses object classifications to reduce the search space of kNN queries in multi-user environment.
机译:空间数据库系统是一种数据库系统,它在其数据模型和查询语言中提供空间数据类型,并在其实现中支持空间数据类型,至少提供空间索引和空间联接方法。空间数据库应用程序(例如,地理信息系统(GIS))通常使用R-tree变体来索引地理数据。空间连接是GIS,地图学和CAD / CAM等应用程序中的重要操作。对于作为空间索引结构的R树的广泛实现,空间连接是一种非常有用的技术。提出了一种基于R树的算法,在多用户环境下对空间对象进行空间连接操作。 K最近邻(k-NN)查询在GIS和CAD / CAM应用程序中用于查找最接近某个给定查询点的k个空间对象。在空间数据库应用程序中快速执行k最近邻(kNN)需要一种信息有效的索引结构,该结构可以有效地减少搜索空间。所提出的方法实现了对R树的扩展,该树使用对象分类来减少多用户环境中kNN查询的搜索空间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号