big o - Time Complexity of $geoNear queries in MongoDB

Question

I'm trying to find the time complexity of the $geoNear query in MongoDB. The reason is I'm trying to see if I should use a KD Tree with KNN to find points near or the mongo query to prevent a slowdown in our API.

Googling around I cannot seem to find this info.

Thanks

question from:https://stackoverflow.com/questions/65903985/time-complexity-of-geonear-queries-in-mongodb

Answer 1

Waitting for answers