Multidimensional Order Preserving Linear Hashing with Partial Expansions
暂无分享,去创建一个
[1] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[2] Ekow J. Otoo,et al. A Mapping Function for the Directory of a Multidimensional Extendible Hashing , 1984, VLDB.
[3] Walter A. Burkhard. Interpolation-based index maintenance , 1983, BIT Comput. Sci. Sect..
[4] Hans-Peter Kriegel. Performance comparison of index structures for multi-key retrieval , 1984, SIGMOD '84.
[5] Ekow J. Otoo,et al. Balanced multidimensional extendible hash tree , 1985, PODS.
[6] Aris M. Ouksel. The interpolation-based grid file , 1985, PODS '85.
[7] Kotagiri Ramamohanarao,et al. Dynamic Hashing Schemes , 1982, Comput. J..
[8] Hans-Peter Kriegel,et al. Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions , 1987, 1987 IEEE Third International Conference on Data Engineering.
[9] Per-Åke Larson,et al. Linear Hashing with Partial Expansions , 1980, VLDB.
[10] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[11] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[12] Klaus Hinrichs,et al. The grid file system , 1985 .