Spatial index in Berkeley DB

Question

Does Berkeley DB have a spatial index such as R-tree?

Answer 1

Someone's asking the same question on the Oracle forum. No Oracle answer yet. But the answer is no, it doesn't have any built-in spatial index functionality. Berkeley DB is a low-level database offering basic functionality which you can build upon. The building blocks are Btree, Hash, Queue and Recno. I don't doubt that a determined programmer could implement spatial indices using those. ;-)

Answer 2

On some other page however you can read that spatial indices are possible. It's because BerkeleyDB has its SQL interface binary compatible with SQLite's interface so you can use anything which is built on top of that. SQLite's R*-trees and full text search are just two examples.