Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.
8 check-ins related to "rtree-performance"
|20:28||Simplifications and performance optimizations for the RTree extension. (check-in: 04a333f5 user: drh tags: trunk)|
|01:46||Reduce the number of calls to sqlite3_mprintf() made by RTree. (Closed-Leaf check-in: f158b7d4 user: drh tags: rtree-performance)|
|17:30||Omit the Reinsert algorithm from RTree. This causes most benchmarks to run faster, at the expense of having a slightly less dense and hence larger index (example: 33 entries/node versus 34 entries/node). (check-in: b3049a1d user: drh tags: rtree-performance)|
|14:07||Performance optimization to cellContains() in RTREE. (check-in: 43cde22b user: drh tags: rtree-performance)|
|13:12||In the ChooseLeaf algorithm of RTREE, do an initial pass through the cells of a node looking for solutions that involve no cell enlargement. Only look for the minimum cell enlargement if the enlargement is non-zero for all cells. This results in a performance improvement by reducing the number of calls to cellUnion(). (check-in: 59f0e239 user: drh tags: rtree-performance)|
|12:06||Reduce the number of calls to cellArea() in the ChooseLeaf() algorithm of rtree. (check-in: c633fe6b user: drh tags: rtree-performance)|
|11:36||Remove unused variable from the ChooseLeaf algorithm in r-tree. (check-in: fb2e4a80 user: drh tags: rtree-performance)|
|11:24||Replace an if() condition in fts5 that is always true with an assert(). (check-in: 2170312c user: dan tags: trunk)|