首页> 外国专利> Being data structure of the multidimensional three-dimensional data which you display the multiple geometric objects which are stored in the record media null disk which records update of multidimensional three-dimensional data structure and the multidimensional three-dimensional data and search manner and

Being data structure of the multidimensional three-dimensional data which you display the multiple geometric objects which are stored in the record media null disk which records update of multidimensional three-dimensional data structure and the multidimensional three-dimensional data and search manner and

机译:是显示存储在记录介质空盘中的多个几何对象的多维三维数据的数据结构,该记录介质空盘记录多维三维数据结构和多维三维数据的更新以及搜索方式,以及

摘要

PROBLEM TO BE SOLVED: To provide a multidimensional space data structure and a method for updating and searching multidimensional space data with which the number of disk accesses in search processing can be reduced and improvement in a search performance can be attained by compressing rectangle position information in a multidimensional space with a partial space code. ;SOLUTION: A geometrical object in the multidimensional space is packed into minimum range rectangle and hierarchized with rectangles as leaves, the most significant rectangle is defined as a non-leaf node, a tree structure is constituted by successively linking leaf nodes to the low-order non-leaf nodes, a real part is provided by expressing the minimum range rectangle with an absolute position, a virtual range rectangle is constituted while being expressed with the partial space code based on a position relative to the minimum range rectangle of the non-leaf node, a virtual part is provided by hierarchizing the virtual range rectangle into tree structure, and in the virtual part, each node is constituted of the number of entries, multidimensional partial space codes expressing the start and end points of each slave node and slave node pointers expressing the storage position of each slave node.;COPYRIGHT: (C)2000,JPO
机译:解决的问题:提供一种多维空间数据结构和一种用于更新和搜索多维空间数据的方法,利用该方法可以减少搜索处理中的磁盘访问次数,并且可以通过压缩矩形位置信息来提高搜索性能。具有部分空间代码的多维空间。 ;解决方案:将多维空间中的几何对象包装到最小范围的矩形中,并以矩形作为叶子进行分层,将最高有效矩形定义为非叶子节点,通过将叶子节点依次链接到低层节点来构成树结构阶非叶节点,通过用绝对位置表示最小范围矩形来提供实部,并基于相对于非矩形最小范围矩形的位置用部分空间代码表示的同时构成虚拟范围矩形。在叶节点上,通过将虚拟范围矩形分层为树结构来提供虚拟部分,并且在虚拟部分中,每个节点都由条目数组成,多维局部空间代码表示每个从节点和从节点的起点和终点表示每个从节点存储位置的节点指针。版权所有:(C)2000,JPO

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号