I think that “number of brilliant-but-insane former graduate students who still live in the campus library” is one of the metrics that U.S. News & World Report uses when ranking physics departments.
format] [-h ] [-n
strategy] [-v ] [-V ] [
The rtree-build program reads CSV files specifying a collection of rectangles, cuboids or higher-dimensional hyperectangles and writes a serialised R-tree to output. Such R-trees can be loaded quickly into programs using librtree.
dimensionof the R-tree to build.
If this option is not given, then
jsonwill be taken as the default.
List the program options.
Specify the number of
nodes(understood to include their branches) in a page of memory. This parameter can affect performance quite dramatically, a value of eight will result in a build which is better than twice as fast as a value of one (for dimension two on AMD64 at least). But a value which is too large will result in a branching factor less than two, which is infeasible for a tree: In this case the program will error.
A value of zero is permitted (and the default), in this case the program will choose a value which has been determined to work well. The value chosen will probably change between versions, so if stability of output is important to you, then some manual experimentation and a fixed value is advised.
Write the output to
file, rather than
Specify the splitting
strategy, one of
quadratic(the default) or
linearstrategy is the fastest to build but will generally result in slower queries than the
J. J. Green,