<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>woeirua</author><text>This is a very inefficient implementation. Really, just poor quality work overall, as anyone with even a basic understanding of spatial indexing would know that an R-tree would be many times faster, as illustrated here: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;medium.com&amp;#x2F;@buckhx&amp;#x2F;unwinding-uber-s-most-efficient-service-406413c5871d&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;medium.com&amp;#x2F;@buckhx&amp;#x2F;unwinding-uber-s-most-efficient-s...&lt;/a&gt;</text><parent_chain></parent_chain></comment><story><title>How we built Uber Engineering&apos;s highest query-per-second service using Go (2016)</title><url>https://eng.uber.com/go-geofence/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>scarejunba</author><text>There&amp;#x27;s a famous &amp;#x27;rebuttal&amp;#x27; post to this here &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;medium.com&amp;#x2F;@buckhx&amp;#x2F;unwinding-uber-s-most-efficient-service-406413c5871d&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;medium.com&amp;#x2F;@buckhx&amp;#x2F;unwinding-uber-s-most-efficient-s...&lt;/a&gt;</text><parent_chain></parent_chain></comment><story><title>How we built Uber Engineering&apos;s highest query-per-second service using Go (2016)</title><url>https://eng.uber.com/go-geofence/</url></story>