Bottoms up parsing for sqlite R*TREE

I'm trying to implement an R-Tree for geo-spatial search on an embedded system. The R-tree will be stored in an SD card. I came across the sqlite implementation of an R*tree. I would like to know if the following is possible before I delve into it further -

1. Bottoms up parsing from the last search. Since I'm using it for planar point location based on gps input. I do not need the search to be repeated every time from the parent node.

2. Running the database directly from the SD card.

Please comment if any additional information is required.