Mapping to one-dimensional values and then using a onedimensional indexing method has been proposed as a way of indexing multi-dimensional data. Most previous related work uses the Z-Order Curve but more recently the Hilbert Curve has been considered since it has superior clustering properties. Any approach, however, can only be of practical value if there are e ective methods for executing range and partial match queries. This paper describes such a method for the Hilbert Curve.
Jonathan K. Lawder, Peter J. H. King