Abstract
We present a new multidimensional dynamic hashing scheme without directory intended for files which grow and shrink dynamically. For previous schemes, the retrieval performance either suffers from a superlinearly growing directory or from an uneven distribution of the records over the pages of a file even for uniform record distribution. Our scheme is a multidimensional order preserving extension of (one-dimensional) linear hashing with partial expansions and thus overcomes these disadvantages. For uniform distribution our scheme performs better than its competitors which is underligned by experimental runs with an implementation of our scheme. In the last section we give a brief outline of the quantile method which guarantees that our scheme performs for a non-uniform distribution practically as well as for a uniform distribution. In addition to its excellent performance, our scheme fulfills all the necessary requirements to be used in an engineering database system: it is dynamic, is suitable for secondary storage devices, supports point data and spatial data objects and supports spatial clustering (proximity queries).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Burkhard, W.A.: ‘Interpolation — based index maintenance', BIT 23, 274–294 (1983)
Hinrichs, K.:'The grid file system: implementation and case studies of applications',Ph.D. Dissertation, Swiss Federal Institute of Technology, Zürich (1985)
Kriegel, H.P.: ‘Performance comparison of index structures for multi-key retrieval', Proc. 1984 ACM/SIGMOD Int. Conf. on Management of Data, 186–196
Kriegel, H.P., Seeger, B.: ‘Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions', submitted for publication
Krishnamurthy, R., Whang, K.-Y.: ‘Multilevel grid files', Draft Report, IBM Research Lab., Yorktown Heights (1985)
Larson, P.-A.: ‘Linear hashing with partial expansions', Proc. 6th Int. Conf. on VLDB, 224–232 (1980)
Litwin, W.: ‘Linear hashing: a new tool for file and table addressing', Proc. 6th Int. Conf. on VLDB, 212–223 (1980)
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: ‘The grid file: an adaptable, symmetric multikey file structure', ACM TODS, 9, 1, 38–71 (1984)
Otoo, E.J.: ‘A mapping function for the directory of a multidimensional extendible hashing', Proc. 10th Int. Conf. on VLDB, 491–506 (1984)
Otoo, E.J.: 'symmetric dynamic index maintenance scheme', Proc. of Int. Conf. on Foundations of Data Org., 283–296 (1985)
Otoo, E.J.: ‘Balanced multidimensional extendible hash tree', Proc. 5th ACM SIGACT/SIGMOD Symp. on PoDS, (1986)
Ouksel, M.: ‘The interpolation based grid file', Proc. 4th ACM SIGACT/SIGMOD Symp. on PoDS, 20–27 (1985)
Robinson, J.T.: ‘The K-D-B-tree: a search structure for large multidimensional dynamic indexes', Proc. 1981 ACM/SIGMOD Int. Conf. on Management of Data, 10–18 (1981)
Romamohanarao, W., Lloyd, J.: ‘Dynamic hashing schemes', Comp. J., 25, 4, 478–485 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, HP., Seeger, B. (1986). Multidimensional order preserving linear hashing with partial expansions. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-17187-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17187-4
Online ISBN: 978-3-540-47346-6
eBook Packages: Springer Book Archive