Globally Order Preserving Multidimensional Linear Hashing
Dynamic multidimensional hashing schemes that locally preserve the order of keys have been derived to support proximity queries. In this paper, we present a dynamic, globally order preserving hashing technique, based on linear hashing, where the spatial proximity of points is preserved beyond data buckets. Our method adaptively generates a bucket numbering which is a flexible variant of the wellknown z-ordering. In addition to the standard set operations the z-ordering supports the efficient implementation of proximity queries.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten