永久(基于磁盘的)R-树(或R *树) [英] Persistent (Disk Based) R-Tree (or R* Tree)

查看:131
本文介绍了永久(基于磁盘的)R-树(或R *树)的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

如何R *树被实现为持久(基于磁盘的)一个? ?什么是用于保存R *树索引或保存叶值文件的架构

How can R* Tree be implemented as a persistent (disk based) one? What is the architecture of the file for saving the R* Tree index or for saving leaf values?

注:另外如何插入,更新和删除操作,可以在执行?这样的执着R *树

Notes: In addition how insert, update and delete operations can be performed in such a persistent R* Tree?

注二:我已经实现了一个内存R-树批量加载功能。但我认为这是完全不相干的,当我们谈论基于磁盘的。

Notes II: I have implemented an in-memory R-Tree with bulk load functionality. But I think that is totally irrelevant when we speak about disk-based ones.

推荐答案

如果您需要一个磁盘上R-tree索引,我会建议使用 Spatialite 或的 PostGIS的。 Spatialite是重量轻,易于在一个独立的应用程序中嵌入。另外,有你看了的 C#空间索引的项目?。我写了Java中的R-树实施了几年回来,不建议,如果事情已经存在这样做。

If you need to have an on-disk R-Tree index, I would suggest using Spatialite or Postgis. Spatialite is lightweight and easy to embed in a standalone application. Alternatively, have you looked at the C# Spatial Index project?. I wrote an R-Tree implementation in Java a few years back and wouldn't recommend doing it if something already exists.

这篇关于永久(基于磁盘的)R-树(或R *树)的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆