作者: Hans-Peter Kriegel , Bernhard Seeger
DOI: 10.1016/0020-0255(89)90014-5
关键词:
摘要: Abstract Previous multidimensional hashing schemes without directory which generalize the concept of Litwin's linear partition data space into equidistant cells using a dynamic orthogonal grid. Thus performance these degenerates in case nonuniform record distributions. We propose new scheme directory, called quantile hashing, avoids this important drawback. Quantile exhibits for independent distributions practically same as uniform The gain comparison with other is demonstrated by experiments.