algorithm for searching in ranges

Question

I am given a huge list of objects with attributes x and y. We are required to search for all objects lying between a given upper and lower bound of both the attributes.

I was wondering if there is an efficient algorithm to implement this.

Thanks!

Answer 1

A quadtree or a spatial index (a space-filling curve, for example a hilbert curve).