Efficient Data Storage and Searching for Location Based Services using Quadtrees and H-ordering?

Data is always stored in secondary storage Devices due to its volume. When it is stored in secondary storage devices, it is required that the access time is as minimal as possible. Most of the queries issued for providing location based services, result in accessing nearest point. This paper provides an algorithm to store the data efficiently so that accessing time is reduced for answering such queries using a space filling curve called Hilbert Curves and quadtrees.