{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:11Z","timestamp":1775282291341,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf01936137","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T05:59:02Z","timestamp":1122789542000},"page":"569-592","source":"Crossref","is-referenced-by-count":35,"title":["Implementation of the grid file: Design concepts and experience"],"prefix":"10.1007","volume":"25","author":[{"given":"Klaus","family":"Hinrichs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF01936137_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"SE-5","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley,Multidimensional binary search trees in database applications, IEEE Trans. Software Engineering SE-5, 4 (1979), 333\u2013340.","journal-title":"IEEE Trans. Software Engineering"},{"key":"BF01936137_CR2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934457","volume":"23","author":"W. A. Burkhard","year":"1983","unstructured":"W. A. Burkhard,Interpolation-based index maintenance, BIT 23 (1983), 274\u2013294.","journal-title":"BIT"},{"key":"BF01936137_CR3","volume-title":"Programming in Prolog","author":"W. F. Clocksin","year":"1981","unstructured":"W. F. Clocksin, C. S. Mellish,Programming in Prolog, Springer Verlag, Berlin, Heidelberg, New York (1981)."},{"issue":"3","key":"BF01936137_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, H. R. Strong,Extendible hashing \u2014 a fast access method for dynamic files, ACM Trans. on Database Systems 4, 3 (1979), 315\u2013344.","journal-title":"ACM Trans. on Database Systems"},{"key":"BF01936137_CR5","unstructured":"K. Hinrichs,The grid file system: implementation and case studies of applications, Diss. ETH No. 7734, ETH Z\u00fcrich (1985)."},{"key":"BF01936137_CR6","first-page":"100","volume-title":"Proceedings of the WG '83 (International Workshop on Graphtheoretic Concepts in Computer Science)","author":"K. Hinrichs","year":"1983","unstructured":"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\u2013113."},{"key":"BF01936137_CR7","doi-asserted-by":"crossref","unstructured":"H.-P. Kriegel,Performance comparison of index structures for multikey retrieval, Proc. ACM SIGMOD, Boston, Massachusetts (1984), 186\u2013196.","DOI":"10.1145\/971697.602284"},{"key":"BF01936137_CR8","unstructured":"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\u2013223."},{"issue":"6","key":"BF01936137_CR9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSE.1982.236022","volume":"SE-8","author":"H. Mendelson","year":"1982","unstructured":"H. Mendelson,Analysis of extendible hashing, IEEE Trans. Softw. Eng. SE-8, 6 (1982), 611\u2013619.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"BF01936137_CR10","unstructured":"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\u2013497."},{"key":"BF01936137_CR11","unstructured":"T. H. Merrett, E. J. Otoo,Dynamic multipaging: a storage structure for large shared data banks, Proc. 2nd Intern. Conf. on Databases \u2014 Improving Usability and Responsiveness, P. Scheuermann (ed.), Academic Press (1982), 237\u2013256."},{"key":"BF01936137_CR12","unstructured":"C. Muller,A Prolog front end to the grid file, diploma thesis, Institut f\u00fcr Informatik, ETH Z\u00fcrich (1984)."},{"issue":"1","key":"BF01936137_CR13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"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\u201371.","journal-title":"ACM Trans. on Database Systems"},{"key":"BF01936137_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02247933","volume":"31","author":"E. J. Otoo","year":"1983","unstructured":"E. J. Otoo, T. H. Merrett,A storage scheme for extendible arrays, Computing 31 (1983), 1\u20139.","journal-title":"Computing"},{"key":"BF01936137_CR15","unstructured":"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\u2013506."},{"key":"BF01936137_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013105.","DOI":"10.1145\/588058.588071"},{"key":"BF01936137_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01934379","volume":"25","author":"M. Regnier","year":"1985","unstructured":"M. Regnier,Analysis of grid file algorithms, BIT 25 (1985), 335\u2013357.","journal-title":"BIT"},{"key":"BF01936137_CR18","doi-asserted-by":"crossref","unstructured":"J. T. Robinson,The k-d-B-tree: a search structure for large multidimensional dynamic indexes, Proc. ACM SIGMOD, Ann Arbor, Michigan (1981), 10\u201318.","DOI":"10.1145\/582318.582321"},{"key":"BF01936137_CR19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01934393","volume":"22","author":"M. Tamminen","year":"1982","unstructured":"M. Tamminen,The extendible cell method for closest point problems, BIT 22 (1982), 27\u201341.","journal-title":"BIT"},{"key":"BF01936137_CR20","volume-title":"On search by address computation, Report HTKK-TKO-B56","author":"M. Tamminen","year":"1983","unstructured":"M. Tamminen,On search by address computation, Report HTKK-TKO-B56, Helsinki University of Technology, Espoo (1983)."},{"key":"BF01936137_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96717-7","volume-title":"Programming in Modula-2","author":"N. Wirth","year":"1982","unstructured":"N. Wirth,Programming in Modula-2, Springer Verlag, Berlin, Heidelberg, New York (1982)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01936137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01936137\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01936137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T13:16:55Z","timestamp":1586351815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01936137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF01936137"],"URL":"https:\/\/doi.org\/10.1007\/bf01936137","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}