{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:21Z","timestamp":1725663921782},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540090"},{"type":"electronic","value":"9783540473480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54009-1_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:21:49Z","timestamp":1330208509000},"page":"173-187","source":"Crossref","is-referenced-by-count":1,"title":["The Nested Interpolation Based Grid File"],"prefix":"10.1007","author":[{"given":"M. Aris","family":"Ouksel","sequence":"first","affiliation":[]},{"given":"Otto","family":"Mayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R. and McCreight, C., \u201dOrganization and Maintenance of Large Ordered Indexes\u201d, Acta Informatica, vol. 1(3), pp. 173\u2013189, 1972.","journal-title":"Acta Informatica"},{"issue":"9","key":"13_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L., \u201dMultidimensional binary Search Trees Used for Associative Indexes\u201d, Communications of ACM, vol. 18(9), pp. 509\u2013517, 1975.","journal-title":"Communications of ACM"},{"key":"13_CR3","unstructured":"Bocca, J., \u201dEduce: a marriage of convenience.\u201d In Int. Symposium on Logic Programming, Sept. 1986, Salt Lake City."},{"key":"13_CR4","unstructured":"Bocca, J. et.al. \u201dSome steps towards a DBMS based KBMS\u201d. IFIP Congress, Sept. 1986, Dublin."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Burkhard, W.A., \u201dInterpolation-Based Index Maintenances\u201d, Proc. Second ACM-SIGMOND Symp. on Principles of Database Systems, Atlanta, Georgia, 1983.","DOI":"10.1145\/588058.588070"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Burkhard, W.A., \u201dIndex Maintenances for Non-Uniform Record Distrubtion\u201d, Proc. Third ACM-SIGMOND Symp. on Principles of Database Systems, Waterloo, Canada, 1984.","DOI":"10.1145\/588011.588036"},{"issue":"3","key":"13_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1983","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H.R., \u201dExtendible Hashing: A Fast Access Method for Dynamic Files\u201d, ACM Transactions on Database Systems, vol. 4(3), pp. 315\u2013344, 1983.","journal-title":"ACM Transactions on Database Systems"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Flajolet, P., \u201dOn the Performance Evaluation of Extendible Hashing and Tree Searching\u201d, Acta Informatica, vol. 20, pp. 345\u2013369, 1983.","journal-title":"Acta Informatica"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Freeston, P., \u201dThe BANG File\u201d, Proc. ACM SIGMOD, pp. 260\u2013269, 1987.","DOI":"10.1145\/38714.38743"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Freeston, P., \u201dAdvances in the design of the BANG file\u201d, Third International Conference on Data Organizations and Algorithms, Paris, 1989.","DOI":"10.1007\/3-540-51295-0_140"},{"key":"13_CR11","unstructured":"Gardarin, G., Valduriez, P., \u201dRelational Databases and Knowledge Bases\u201d, Addison Wesley, 1989."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Hinrichs, K., \u201dImplementation of the Grid File\u201d, BIT, vol. 25, 1985.","DOI":"10.1007\/BF01936137"},{"key":"13_CR13","unstructured":"Litwin, W., \u201dLinear Hashing: A New Tool for File and Table Addressing\u201d, Proc. Sixth Int. Conf. on Very Large Data Bases, Montreal, Canada, pp. 212\u2013223, 1980."},{"issue":"1","key":"13_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, J., and Sevcik, K.C., \u201dThe Grid File: An Adaptable Symmetric Multikey File Structure\u201d, ACM Transactions of Database Systems, vol. 9(1), pp. 38\u201371, 1984.","journal-title":"ACM Transactions of Database Systems"},{"key":"13_CR15","unstructured":"Orenstein, J., \u201dMultidimensional Tries used for Associative Searching\u201d, Proc. Ninth Int. Conf. on Very Large Databases, Florence, Italy, pp. 132\u2013141, 1983."},{"issue":"5","key":"13_CR16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/32.6139","volume":"14","author":"J. Orenstein","year":"1988","unstructured":"Orenstein, J. and Manola, F.A., \u201dPROBE Spatial Data Modeling and query Processing in an Image Database Application\u201d, IEEE Transactions on Software Engineering, vol. 14(5), pp. 611\u2013629, 1988.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Otoo, E.J., \u201dBalanced Multidimensional Extendible Hash Trees\u201d, Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1986.","DOI":"10.1145\/6012.6015"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(88)90058-0","volume":"29","author":"M. Ouksel","year":"1988","unstructured":"Ouksel, M. and Scheuermann, P., \u201dImplicit Data Structures\u201d, Information Processing Letters 29, pp. 183\u2013189, 1988.","journal-title":"Information Processing Letters"},{"key":"13_CR19","unstructured":"Ouksel, M. and Mayer, O., \u201dExploiting Access Path Information from Concurrent Operations to Improve Throughput\u201d, CRIM Working Paper, No. 89-9."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Ouksel, M. and Yaaghoub, A., The Interpolation-Based Bintree and its Application to Graphics, (submitted to Journal of Vision, Graphics, and Image Processing).","DOI":"10.1007\/3-540-54029-6_156"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Ouksel, M. and Scheuermann, P., \u201dStorage Mappings for Multidimensional Linear Dynamic Hashing\u201d, Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983.","DOI":"10.1145\/588058.588071"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Ouksel, M., \u201dThe Interpolation-Based Grid File\u201d, Proc. 4th ACM SIGACT-SIGMOD Symposium on Principles of Data Base Systems, pp. 20\u201327, 1985.","DOI":"10.1145\/325405.325408"},{"key":"13_CR23","unstructured":"Ouksel, M., \u201dThe Interpolation-Based Grid File: A Spatial Data Representation Scheme, CLEAR Center Report, 1989."},{"key":"13_CR24","unstructured":"Ozkarahan, E. and Ouksel, M., \u201dDynamic Order-Preserving Partitioning for Database Machines\u201d, Proc. Eleventh Int. Conf. on Very Large Data Bases, Stockholm, 1985."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Robinson, J.T., \u201dthe K-D-B-tree: A search structure for large multidimensional dynamic Surveys\u201d, ?, vol. ?, pp. 10\u201318, 1981.","DOI":"10.1145\/582319.582321"},{"issue":"2","key":"13_CR26","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H., \u201dThe Quadtree and Related Hierarchical Data Structures\u201d, ACM Computing Surveys, vol. 16(2), pp. 184\u2013260, 1984.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"13_CR27","first-page":"123","volume":"7","author":"P. Scheuermann","year":"1982","unstructured":"Scheuermann, P. and Ouksel, M., \u201dMultidimensional B-trees for Associative Searching in Database Systems\u201d, Information Systems Journal, vol. 7(2), pp. 123\u2013137, 1982.","journal-title":"Information Systems Journal"},{"key":"13_CR28","unstructured":"Seeger, B. and Kriegel, H., \u201dTechniques for Design and Implementation of Efficient Spatial Access Methods\u201d, Proc. Fourteenth Int. Conf. on Very Large Databases, Los Angeles, USA, pp. 360\u2013371, 1988."},{"key":"13_CR29","unstructured":"Thom, J., Naish, L. and Ramamohanarao, K., \u201dA superjoin algorithm for deductive databases\u201d, Very Large Data Bases, Aug. 1986, Kyoto."}],"container-title":["Lecture Notes in Computer Science","MFDBS 91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54009-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:56Z","timestamp":1605646316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54009-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540090","9783540473480"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-54009-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}