4 ms·
"For each lookup, we first find the desired city with a linear scan of all the city geofences, and then find the containing geofences within that city with anot
by paggle 7y ago
"For each lookup, we first find the desired city with a linear scan of all the city geofences, and then find the containing geofences within that city with another linear scan."
Why wouldn't this be dogshit slow if they used all of the city geofences at once? I would think that first they would scan the country geofences, then the province geofences, then the city geofences, etc...
- mbo 7y agoIt's almost like they could have used some sort of specialised tree data structure where each tree node was assigned to some spatial region on the map, where successive levels were assigned to increasingly smaller regions.