{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T05:45:44Z","timestamp":1698212744222},"reference-count":14,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5558,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper proposes an RMD\u2010tree (region multidimensional tree), which is a method of data management based on the tree structure, aiming at the efficient management and retrieval of spatial objects with nonzero sizes.<\/jats:p><jats:p>In the proposed method, the spatial object in the <jats:italic>N<\/jats:italic>\u2010dimensional space corresponds to a point in the 2<jats:italic>N<\/jats:italic>\u2010dimensional space, being represented by its centroid and the extent along each axis. The coordinate transformation is applied to the point data and the data are managed by the tree structure, so that retrieval such as the point location problem or the range search in the <jats:italic>n<\/jats:italic>\u2010dimensional space can be performed only by the search for the point data in the hyper\u2010rectangle range.<\/jats:p><jats:p>By this approach, the space splitting and data management are made possible considering the size of the object as well as the centroid. By the coordinate transformation the object data are represented by the maximum and the minimum in the original <jats:italic>N<\/jats:italic>\u2010dimensional space, multiplied by a certain factor.<\/jats:p><jats:p>It is indicated by simulation experiments that the speed of search is improved by this method by a factor of 2 to 4, compared to the conventional method when the size of the object to be managed is enlarged. When points and objects with small sizes are to be handled, the performance is almost the same as that of the conventional method. In the experiment using the actual printed circuit board data, the speed of search also is improved by approximately a factor of 2.<\/jats:p>","DOI":"10.1002\/scj.4690230303","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T23:31:49Z","timestamp":1183851109000},"page":"26-37","source":"Crossref","is-referenced-by-count":1,"title":["RMD\u2010tree: A hierarchical data structure for multidimensional nonzero size spatial objects using MD\u2010tree"],"prefix":"10.1002","volume":"23","author":[{"given":"Yasuaki","family":"Nakamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Abe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"Ohsawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Sakauchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Spatial Data Structures","author":"Samet H.","year":"1989"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"issue":"10","key":"e_1_2_1_4_2","first-page":"1193","article-title":"A proposal for multidimensional data management structure with excellent dynamic performance. Trans. (D)","volume":"66","author":"Osawa Y.","year":"1983","journal-title":"I.E.I.C.E., Japan"},{"issue":"9","key":"e_1_2_1_5_2","first-page":"1745","article-title":"Management of multidimensional data by balanced tree\u2014Proposal of MD\u2010tree. Trans. (D)","volume":"71","author":"Nakamura Y.","year":"1988","journal-title":"I.E.I.C.E., Japan"},{"issue":"4","key":"e_1_2_1_6_2","first-page":"845","article-title":"Drawing processing by multidimensional data structure\u2014Vector representation of drawing. Trans. (D)","volume":"68","author":"Osawa Y.","year":"1985","journal-title":"I.E.I.C.E., Japan"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A.Guttman.R\u2010tree: A dynamic index structure for spatial searching. Proc. SIGMOD pp.47\u201357(1984).","DOI":"10.1145\/971697.602266"},{"key":"e_1_2_1_8_2","unstructured":"T.Sellis N.RoussopoulosandC.Faloutsos.The R+\u2010tree: A dynamic index for multidimensional objects. Proc. 13th VLDB pp.507\u2013518(1987)."},{"key":"e_1_2_1_9_2","first-page":"6C\u20101","volume-title":"Improvement of search efficiency for line figure data by line segmentation","author":"Matsuoka M.","year":"1989"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_2_1_11_2","article-title":"Performance evaluation of file division algorithm based on spatial distance. Papers of Technical Group on Information Engineering","volume":"81","author":"Matsuyama T.","year":"1981","journal-title":"I.E.I.C.E., Japan"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"J. T.Robinson.The K\u2010D\u2010B\u2010tree: A search structure for large multidimensional dynamic indexes. Proc. ACM SIGMOD pp.10\u201318(1981).","DOI":"10.1145\/582318.582321"},{"key":"e_1_2_1_13_2","first-page":"3","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_14_2","first-page":"7734","volume-title":"The Grid File System: Implementation and Case Studies of Applications","author":"Hinrichs K. H.","year":"1985"},{"key":"e_1_2_1_15_2","first-page":"99","volume-title":"Management of spatial objects with nonzero size by tree structure","author":"Nakamura Y.","year":"1990"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690230303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690230303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:23:43Z","timestamp":1698164623000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690230303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/scj.4690230303"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690230303","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}