Abstract
The grid file is an adaptable, symmetric multikey file structure. It stores highly dynamic sets of multidimensional data in such a way that different types of queries can be performed using few disk accesses. We present the design concepts underlying our implementation of the grid file and describe applications of thegrid file system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. L. Bentley,Multidimensional binary search trees in database applications, IEEE Trans. Software Engineering SE-5, 4 (1979), 333–340.
W. A. Burkhard,Interpolation-based index maintenance, BIT 23 (1983), 274–294.
W. F. Clocksin, C. S. Mellish,Programming in Prolog, Springer Verlag, Berlin, Heidelberg, New York (1981).
R. Fagin, J. Nievergelt, N. Pippenger, H. R. Strong,Extendible hashing — a fast access method for dynamic files, ACM Trans. on Database Systems 4, 3 (1979), 315–344.
K. Hinrichs,The grid file system: implementation and case studies of applications, Diss. ETH No. 7734, ETH Zürich (1985).
K. Hinrichs, J. Nievergelt,The grid file: a data structure designed to support proximity queries on spatial objects, Proceedings of the WG '83 (International Workshop on Graphtheoretic Concepts in Computer Science), M. Nagl, J. Perl (ed.), Trauner Verlag, Linz (1983), 100–113.
H.-P. Kriegel,Performance comparison of index structures for multikey retrieval, Proc. ACM SIGMOD, Boston, Massachusetts (1984), 186–196.
W. Litwin,Linear hashing: a new tool for table and file addressing, Proc. 6th Intern. Conf. on Very Large Data Bases, Montreal, Canada (1980), 212–223.
H. Mendelson,Analysis of extendible hashing, IEEE Trans. Softw. Eng. SE-8, 6 (1982), 611–619.
T. H. Merrett, Y. Kambayashi, H. Yasuura,Scheduling of page-fetches in join operations, Proc. 7th Intern. Conf. on Very Large Data Bases, Cannes, France (1981), 488–497.
T. H. Merrett, E. J. Otoo,Dynamic multipaging: a storage structure for large shared data banks, Proc. 2nd Intern. Conf. on Databases — Improving Usability and Responsiveness, P. Scheuermann (ed.), Academic Press (1982), 237–256.
C. Muller,A Prolog front end to the grid file, diploma thesis, Institut für Informatik, ETH Zürich (1984).
J. Nievergelt, H. Hinterberger, K. C. Sevcik,The grid file: an adaptable, symmetric multikey file structure, ACM Trans. on Database Systems 9, 1 (1984), 38–71.
E. J. Otoo, T. H. Merrett,A storage scheme for extendible arrays, Computing 31 (1983), 1–9.
E. J. Otoo,A mapping function for the directory of a multidimensional extendible hashing, Proc. 10th Intern. Conf. on Very Large Data Bases, Singapore (1984), 493–506.
M. Ouksel, P. Scheuermann,Storage mappings for multidimensional linear dynamic hashing, Proc. 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, Georgia (1983), 90–105.
M. Regnier,Analysis of grid file algorithms, BIT 25 (1985), 335–357.
J. T. Robinson,The k-d-B-tree: a search structure for large multidimensional dynamic indexes, Proc. ACM SIGMOD, Ann Arbor, Michigan (1981), 10–18.
M. Tamminen,The extendible cell method for closest point problems, BIT 22 (1982), 27–41.
M. Tamminen,On search by address computation, Report HTKK-TKO-B56, Helsinki University of Technology, Espoo (1983).
N. Wirth,Programming in Modula-2, Springer Verlag, Berlin, Heidelberg, New York (1982).
Author information
Authors and Affiliations
Additional information
This work was carried out while the author was at the Institut für Informatik, ETH, CH-8092 Zürich, Switzerland.
Rights and permissions
About this article
Cite this article
Hinrichs, K. Implementation of the grid file: Design concepts and experience. BIT 25, 569–592 (1985). https://doi.org/10.1007/BF01936137
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01936137