R-tree 索引结构实现

上传者: pisces7625 | 上传时间: 2021-04-21 19:50:56 | 文件大小: 1.76MB | 文件类型: RAR
R-tree用于索引多维数据对象,利用数据对象间的相对位置建立最小边界矩形(MBR),可在此结构上完成高效查询算法如kNN与范围查询

文件下载

资源详情

[{"title":"( 40 个子文件 1.76MB ) R-tree 索引结构实现","children":[{"title":"rtree","children":[{"title":"bin","children":[{"title":"Query_5.txt <span style='color:#111;'> 150B </span>","children":null,"spread":false},{"title":"rtree.exe <span style='color:#111;'> 88.00KB </span>","children":null,"spread":false},{"title":"test.rt <span style='color:#111;'> 8.00KB </span>","children":null,"spread":false},{"title":"2.txt <span style='color:#111;'> 23B </span>","children":null,"spread":false},{"title":"dataSet.txt <span style='color:#111;'> 19.53KB </span>","children":null,"spread":false}],"spread":true},{"title":"include","children":[{"title":"Point.h <span style='color:#111;'> 569B </span>","children":null,"spread":false},{"title":"blockFile.h <span style='color:#111;'> 1.25KB </span>","children":null,"spread":false},{"title":"Rect.h <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false},{"title":"rtree.h <span style='color:#111;'> 7.84KB </span>","children":null,"spread":false},{"title":"TimeCounter.h <span style='color:#111;'> 216B </span>","children":null,"spread":false},{"title":"Release","children":null,"spread":false},{"title":"Sphere.h <span style='color:#111;'> 610B </span>","children":null,"spread":false}],"spread":true},{"title":"src","children":[{"title":"main.cpp <span style='color:#111;'> 5.80KB </span>","children":null,"spread":false},{"title":"Rect.cpp <span style='color:#111;'> 6.03KB </span>","children":null,"spread":false},{"title":"rtree.cpp <span style='color:#111;'> 31.77KB </span>","children":null,"spread":false},{"title":"Point.cpp <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false},{"title":"blockFile.cpp <span style='color:#111;'> 4.18KB </span>","children":null,"spread":false},{"title":"TimeCounter.cpp <span style='color:#111;'> 395B </span>","children":null,"spread":false},{"title":"Sphere.cpp <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"project","children":[{"title":"rtree.opt <span style='color:#111;'> 53.50KB </span>","children":null,"spread":false},{"title":"rtree.ncb <span style='color:#111;'> 121.00KB </span>","children":null,"spread":false},{"title":"Release","children":[{"title":"TimeCounter.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"blockFile.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"Rect.obj <span style='color:#111;'> 11.54KB </span>","children":null,"spread":false},{"title":"blockFile.obj <span style='color:#111;'> 7.13KB </span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'> 65.00KB </span>","children":null,"spread":false},{"title":"rtree.obj <span style='color:#111;'> 50.50KB </span>","children":null,"spread":false},{"title":"Sphere.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"rtree.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"rtree.pch <span style='color:#111;'> 4.58MB </span>","children":null,"spread":false},{"title":"rtree.bsc <span style='color:#111;'> 2.03MB </span>","children":null,"spread":false},{"title":"TimeCounter.obj <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"Point.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"main.obj <span style='color:#111;'> 17.59KB </span>","children":null,"spread":false},{"title":"Sphere.obj <span style='color:#111;'> 2.89KB </span>","children":null,"spread":false},{"title":"main.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"Point.obj <span style='color:#111;'> 2.61KB </span>","children":null,"spread":false},{"title":"Rect.sbr <span style='color:#111;'> 0B </span>","children":null,"spread":false}],"spread":false},{"title":"rtree.dsp <span style='color:#111;'> 5.09KB </span>","children":null,"spread":false},{"title":"rtree.dsw <span style='color:#111;'> 533B </span>","children":null,"spread":false},{"title":"rtree.plg <span style='color:#111;'> 246B </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • lidianxii :
    学习了,谢谢
    2018-03-05
  • chrome_shui :
    其实R树的理论性还是强于实践性的,不错的实现,谢谢分享。
    2018-02-05
  • river0821 :
    C++的, 我想要的C的呢~~╮(╯▽╰)╭ 还是谢谢分享者啊~~~
    2014-06-06
  • korile256 :
    是C++代碼,但註解比較少,學習了 謝謝!
    2013-10-19
  • swfczkl2 :
    C++实现的R树代码,如果有详细点的注释就好
    2013-09-13
  • deeper2 :
    很实用,感谢!
    2013-03-12
  • crazy_hit :
    需要的就是C++代码
    2013-02-27
  • BIFANGJIN :
    这个R树实现的比较好,很多异常都考虑到了,在vs2008上稍微改掉几个头文件写法,就能编译运行了,谢谢了
    2012-12-26
  • jiejinghan :
    是完整的代码,可惜在VS2010中有错
    2012-12-18
  • Idylliclife :
    索引用C++实现,但对于数据库创建索引是如何创建的呢?continue to search...
    2012-04-14

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明