News for hackers. Stuff that matters.
Re:How we built Uber Engineering's highest query-per-second ... by xtomus on Thursday November 14, 2019 @04:45PM (#21539812)
You can either ship a 2 dimensional linear search approach today or ship an R tree based approach in 2 weeks time. I know which one in choosing if they both meet all of the requirements
Re:How we built Uber Engineering's highest query-per-second ... by woeirua on Thursday November 14, 2019 @05:29PM (#21540193)
Just about every modern language has a well established R-tree library...
Re:How we built Uber Engineering's highest query-per-second ... by icholy on Thursday November 14, 2019 @11:43PM (#21542253)
I mean why stop there? Let's remove the database indexes too. Hell, why use a hashtable when you have lists amirite?