我在主内存中创建一个R *树：

size_t capacity = 10;
bool bWriteThrough = false;
fileInMem = StorageManager
    ::createNewRandomEvictionsBuffer(*memStorage,capacity,bWriteThrough);

double fillFactor = 0.7;
size_t indexCapacity = 10;
size_t leafCapacity = 10;
size_t dimension = 2;
RTree::RTreeVariant rv = RTree::RV_RSTAR;
tree = RTree::createNewRTree(*fileInMem,fillFactor,indexCapacity,leafCapacity,dimension,rv,indexIdentifier);

然后我插入了大量的边界框,目前大约2.5M(德国巴伐利亚州的公路网).后来我的目标是插入欧洲的所有道路.

存储管理器和rtree的参数选择有哪些？大多数情况下,我使用rtree来查找到给定查询(bBox交叉点)最近的道路.