{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:29:41Z","timestamp":1735882181189,"version":"3.32.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf01932838","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:39:29Z","timestamp":1122269969000},"page":"401-418","source":"Crossref","is-referenced-by-count":10,"title":["MultidimensionalB-trees: Analysis of dynamic behavior"],"prefix":"10.1007","volume":"21","author":[{"given":"Mohamed","family":"Ouksel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Scheuermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01932838_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/320455.320457","volume":"1","author":"M. Astrahan","year":"1976","unstructured":"M. Astrahan et al.,System R: Relational approach to database management, ACM Trans. on Database Syst., 1(2), 97\u2013137, (1976).","journal-title":"ACM Trans. on Database Syst."},{"issue":"3","key":"BF01932838_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and C. McCreight,Organization and maintenance of large ordered indexes, Acta Informatica, 1(3), 173\u2013189, (1972).","journal-title":"Acta Informatica"},{"issue":"9","key":"BF01932838_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"J. L. Bentley,Multidimensional binary search trees used for associative searching, Comm. of ACM, 18(9), 509\u2013517, (1975).","journal-title":"Comm. of ACM"},{"issue":"4","key":"BF01932838_CR4","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. on Soft. Eng., SE-5(4), 333\u2013340, (1979).","journal-title":"IEEE Trans. on Soft. Eng."},{"issue":"9","key":"BF01932838_CR5","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/362342.362352","volume":"16","author":"A. F. Cardenas","year":"1973","unstructured":"A. F. Cardenas,Evaluation and selection of file organization\u2014a model and system, Comm. of ACM, 16(9), 540\u2013548, (1973).","journal-title":"Comm. of ACM"},{"issue":"1","key":"BF01932838_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/comjnl\/20.1.15","volume":"20","author":"A. F. Cardenas","year":"1977","unstructured":"A. F. Cardenas and J. P. Sagamang,Double-chained tree data base organization\u2014analysis and design strategies, The Computer Journal, 20(1), 15\u201326, (1977).","journal-title":"The Computer Journal"},{"key":"BF01932838_CR7","doi-asserted-by":"crossref","unstructured":"J. M. Chang and K. S. Fu,Extended k-d tree database organization: a dynamic multi-attribute clustering method, Proc. Third COMPSAC Conf., Chicago, Nov. 1979, 39\u201344.","DOI":"10.1109\/CMPSAC.1979.762462"},{"issue":"2","key":"BF01932838_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer,The ubiquitious B-tree, ACM Computing Surveys, 11(2), 121\u2013138, (1979).","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"BF01932838_CR9","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\u2014a fast access method for dynamic files, ACM Trans. on Database Systems, 4(3), 315\u2013344, (1979).","journal-title":"ACM Trans. on Database Systems"},{"issue":"1","key":"BF01932838_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/320128.320135","volume":"5","author":"V. Gopalakrishna","year":"1980","unstructured":"V. Gopalakrishna and C. E. Veni Madhavan,Performance evaluation of attribute-based tree organization, ACM Trans. on Database Syst., 5(1), 69\u201387, (1980).","journal-title":"ACM Trans. on Database Syst."},{"key":"BF01932838_CR11","doi-asserted-by":"crossref","unstructured":"E. Gudes and S. Tsur,Experiments with B-tree reorganization, Proc. ACM SIGMOD Intern. Conf. on Manag. of Data, Santa Monica, Calif. 200\u2013206, (1980).","DOI":"10.1145\/582250.582281"},{"key":"BF01932838_CR12","doi-asserted-by":"crossref","unstructured":"R. L. Kashyap, S. K. C. Subas and S. B. Yao,Analysis of the multiple-attribute-tree data-base organization, IEEE Trans. on Soft. Eng., Vol. SE-3(6), 451\u2013466.","DOI":"10.1109\/TSE.1977.231175"},{"key":"BF01932838_CR13","volume-title":"The Art of Computer Programming, Vol. 3:Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3:Sorting and Searching, Addison-Wesley, Reading, Mass., (1973)."},{"issue":"3","key":"BF01932838_CR14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/320613.320618","volume":"5","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee and C. K. Wong,Quintary tree: A file structure of multidimensional database systems, ACM Trans. on Database Syst., 5(3), 339\u2013353, (1980).","journal-title":"ACM Trans. on Database Syst."},{"key":"BF01932838_CR15","doi-asserted-by":"crossref","unstructured":"E. Y. Lien, E. L. Taylor, R. J. Driscoll and L. M. Reynolds,Binary search tree complex\u2014towards the implementations, Proc. First Intern. Conf. on Very Large Data Bases, Framingham, Mass., 540\u2013542, (1975).","DOI":"10.1145\/1282480.1282542"},{"key":"BF01932838_CR16","unstructured":"W. Litwin,Linear hashing: A new tool for file and table addressing, Proc. Sixth Intern. Conf. on Very Large Data Bases, Montreal, (1980)."},{"issue":"11","key":"BF01932838_CR17","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/362790.362794","volume":"13","author":"V. T. Lum","year":"1970","unstructured":"V. T. Lum,Multi-attribute retrieval with combined indices, Comm. of ACM, 13(11), 660\u2013665 (1970).","journal-title":"Comm. of ACM"},{"key":"BF01932838_CR18","doi-asserted-by":"crossref","unstructured":"A. L. Rosenberg and L. Snyder,Compact B-trees, Proc. ACM-SIGMOD Intern. Conf. on Manag. of Data, Boston, Mass., 43\u201351, (1972).","DOI":"10.1145\/582095.582102"},{"key":"BF01932838_CR19","unstructured":"P. Scheuermann and M. Ouksel,Multidimensional B-trees for associative searching in database systems, to appear in Information Systems."},{"issue":"6","key":"BF01932838_CR20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/362248.362267","volume":"16","author":"B. Shneiderman","year":"1973","unstructured":"B. Shneiderman,Optimum data base reorganization points, Comm. of ACM, 16(6), 362\u2013365, (1973).","journal-title":"Comm. of ACM"},{"issue":"4","key":"BF01932838_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0306-4379(77)90003-5","volume":"2","author":"B. Shneiderman","year":"1977","unstructured":"B. Shneiderman,Reduced combined indexes for efficient multiple attribute retrieval, Information Systems, 2(4), 149\u2013154, (1977).","journal-title":"Information Systems"},{"key":"BF01932838_CR22","unstructured":"H. Wedekind,On the selection of access paths in a data base system, in Data Base Management, J. Klimbie and K. Koffeman (eds.), North-Holland 385\u2013397, (1974)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932838.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01932838\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T17:19:25Z","timestamp":1735838365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01932838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01932838"],"URL":"https:\/\/doi.org\/10.1007\/bf01932838","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"type":"print","value":"0006-3835"},{"type":"electronic","value":"1572-9125"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}