{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T20:49:43Z","timestamp":1660250983648},"reference-count":28,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1989]]},"DOI":"10.1051\/ita\/1989230201651","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:09:46Z","timestamp":1486048186000},"page":"165-176","source":"Crossref","is-referenced-by-count":1,"title":["An application of $m$-ary trees to the design of data structures for geometric searching problems"],"prefix":"10.1051","volume":"23","author":[{"given":"M.","family":"Talamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Gambosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L., Multidimensional Divide and Conquer, Communications of A.C.M., vol. 23, 1980, pp. 214-229.5671500434.68049","DOI":"10.1145\/358841.358850"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L., Multidimensional Binary Search Trees Used for Associative Searching, Communications of A.C.M., vol. 18, 1975, pp. 509-517.0306.68061","DOI":"10.1145\/361002.361007"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L., Multidimensional Binary Search Trees in Database Applications, I.E.E.E. Trans. on Software Engineering, vol. 5, 1979, pp. 333-340.0411.68055","DOI":"10.1109\/TSE.1979.234200"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L., Decomposable Searching Problems, Information Processing Letters, vol. 8, 1979, pp. 244-251.5340720404.68067","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L. and FRIEDMAN J. H., Data Structures for Range Searching, Computing Surveys, vol. 11, 1979, pp. 397-409.","DOI":"10.1145\/356789.356797"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L. and MAURER H. A., Efficient Worst-case Data Structures for Range Searching, Acta Informatica, vol. 13, 1980, pp. 155-168.5644620423.68029","DOI":"10.1007\/BF00263991"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L. and SAXE J. B., Decomposable Searching Problems # 1: Static to Dynamic Transformations, Journal of Algorithms, vol. 1, 1980, pp. 301-358.6048690461.68065","DOI":"10.1016\/0196-6774(80)90015-2"},{"key":"R8","unstructured":"BENTLEY J. L. and SHAMOS M. I., A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications, Proc. 15th Annual Allerton Conf. on Communication, Control and Computing, 1977, pp. 193-201."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"BENTLEY J. L. and WOOD D., An Optimal Worst-case Algorithm for Reporting Intersection of Rectangles, I.E.E.E. Trans. on Computers, vol. 29, 1980, pp. 571-577.581619","DOI":"10.1109\/TC.1980.1675628"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"CHAZELLE B. M., Filtering Search: a New Approach to Query Answering, Proc. 24th I.E.E.E. Symp. on Foundations of Computer Science, 1983, pp. 122-132.","DOI":"10.1109\/SFCS.1983.17"},{"key":"R11","unstructured":"CHAZELLE B. M. and EDELSBRUNNER H., Linear Space Data Structures for two Types of Range Search, Tech. Report 202, Inst. of Computer Science, University of Graz, 1985.0624.68054"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"FINKEL R. A. and BENTLEY J. L., Quad Trees: a Data Structure for Retrieval of Composite Keys, Acta Informatica, vol. 4, 1974, pp. 1-9.0278.68030","DOI":"10.1007\/BF00288933"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"FREDMAN M. F., A Lower Bound on the Complexity of Orthogonal Range Queries, Journal ACM 28, 1981, pp. 696-706.6770810468.68049","DOI":"10.1145\/322276.322281"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"FREDMAN M. F., Lower Bounds on the Complexity of Some Optimal Data Structures, SIAM Journal on Computing 10, 1981, pp. 1-10.6055990454.68006","DOI":"10.1137\/0210001"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"GABOW H. N., BENTLEY J. L. and TARJAN R. E., Scaling and Related Techniques for Geometry Problems, Proc. 16th Symp. on Theory of Computing, 1984, pp. 135-143.","DOI":"10.1145\/800057.808675"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"LEE D. T. and WONG C. K., Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees, Acta Informatica, vol. 9, 1977, pp. 23-29.4646760349.68016","DOI":"10.1007\/BF00263763"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"LEE D. T. and WONG C. K., Finding Intersection of Rectangles by Range Search, Journal of Algorithms, vol. 2, 1981, pp. 337-347.640518","DOI":"10.1016\/0196-6774(81)90033-X"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"LEE D. T. and WONG C. K., Quintary Trees: a File Structure for Multidimensional Database Systems, A.C.M. Trans. on Database Systems, vol. 5, 1980, pp. 339-353.0441.68122","DOI":"10.1145\/320613.320618"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"VAN LEEUWEN J. and WOOD D., Dynamization of Decomposable Searching Problems, Information Processing Letters, vol. 10, 1980, pp. 51-56.564499","DOI":"10.1016\/S0020-0190(80)90073-3"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"LUEKER G. S and WILLARD D. E., A Data Structure for Dynamic Range Queries, Information Processing Letters, vol. 15, 1982, pp. 209-213.6842530511.68080","DOI":"10.1016\/0020-0190(82)90119-3"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"NIEVERGELT J., HINTERBERGER H. and SEVCIK K., The Grid File: an Adaptable, Symmetric Multikey Data Structure, A.C.M. Trans. on Database Systems, vol. 9, 1984, pp. 38-71.","DOI":"10.1145\/348.318586"},{"key":"R22","unstructured":"OVERMARS M. H., The Design of Dynamic Data Structures, Lectures Notes on Computer Science, Vol. 156, Springer Verlag, New York.7108320545.68009"},{"key":"R23","unstructured":"OVERMARS M. H., The Equivalence of Rectangle Containment, Rectangle Enclosure and ECDF Searching, Tech. Report RUU-CS-81-1, Dept. of Computer Science, University of Utrecht, 1981."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"ROBINSON J. T., The K-D-B Tree: a Search Structure for Large Multidimensional Dynamic Indexes, Proc. of the SIGMOD Conference, 1981, pp. 10-18.","DOI":"10.1145\/582318.582321"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"VUILLEMIN J., A Unifying Look at Data Structures, Communications of A.C.M., Vol. 23, 1980, pp. 229-239.5671510434.68047","DOI":"10.1145\/358841.358852"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"WILLARD D. E., New Data Structures for Orthogonal Range Queries, S.I.A.M. Journal on Computing, Vol. 14, 1985, pp. 232-253.7749420564.68071","DOI":"10.1137\/0214019"},{"key":"R27","unstructured":"WILLARD D. E., Lower Bounds for Dynamic Range Queries That Permit Subtraction (to appear).0596.68066"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"WILLARD D. E. and LUEKER G. S., Adding Range Restriction Capability to Dynamic Data Structures, Journal A.C.M., Vol. 32, 1985, pp. 597-617.7962040629.68097","DOI":"10.1145\/3828.3839"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230201651\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:59:34Z","timestamp":1568786374000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230201651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":28,"journal-issue":{"issue":"2"},"alternative-id":["ita1989230201651"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1989230201651","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}