{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:23:12Z","timestamp":1725470592715},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540378716"},{"type":"electronic","value":"9783540378723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11827405_45","type":"book-chapter","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T15:44:55Z","timestamp":1158594295000},"page":"459-466","source":"Crossref","is-referenced-by-count":1,"title":["A Forced Transplant Algorithm for Dynamic R-tree Implementation"],"prefix":"10.1007","author":[{"given":"Mingbo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Feng","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Changxiu","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","first-page":"339","volume-title":"Advances in Spatial Databases","author":"C.H. Ang","year":"1997","unstructured":"Ang, C.H., Tan, T.C.: New Linear Node Splitting Algorithm for R-trees. In: Scholl, M.O., Voisard, A. (eds.) SSD 1997. LNCS, vol.\u00a01262, pp. 339\u2013349. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of SIGMOD, Atlantic City, New Jersey, pp. 322\u2013331 (1990)","key":"45_CR2","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"doi-asserted-by":"crossref","unstructured":"Garcia, Y., Lopez, M., Leutenegger, S.: A Greedy Algorithm for Bulk Loading R-trees. In: Proceedings of 6th ACM-GIS, Washington, DC, pp. 163\u2013164 (1998)","key":"45_CR4","DOI":"10.1145\/288692.288723"},{"unstructured":"Garcia, Y., Lopez, M., Leutenegger, S.: On Optimal Node Splitting for R-trees. In: Proceedings of 24th VLDB, New York, pp. 334\u2013344 (1998)","key":"45_CR5"},{"doi-asserted-by":"crossref","unstructured":"Garcia, Y., Lopez, M., Leutenegger, S.: Post-optimization and Incremental Refinement of R-trees. In: Proceedings of ACM GIS 1999, Kansas City, USA, pp. 91\u201396 (1999)","key":"45_CR6","DOI":"10.1145\/320134.320159"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings of ACM SIGMOD, Boston, MA, pp. 47\u201357 (1984)","key":"45_CR7","DOI":"10.1145\/602259.602266"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0164-1212(00)00078-9","volume":"55","author":"P.W. Huang","year":"2001","unstructured":"Huang, P.W., Lin, P.L., Lin, H.Y.: Optimizing Storage Utilization in R-tree Dynamic Index Structure for Spatial Databases. Journal of Systems and Software\u00a055, 291\u2013299 (2001)","journal-title":"Journal of Systems and Software"},{"unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: an Improved R-tree Using Fractals. In: Proceedings of 20th VLDB, Santiago, Chile, pp. 500\u2013509 (1994)","key":"45_CR9"},{"doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On Packing R-trees. In: Proceedings of CIKM, Washington, DC, USA, pp. 490\u2013499 (1993)","key":"45_CR10","DOI":"10.1145\/170088.170403"},{"doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Edgington, J.M., Lopez, M.A.: STR: a Simple and Efficient Algorithm for R-tree Packing. In: Proceedings of 13th IEEE ICDE, Birmingham, England, pp. 497\u2013506 (1997)","key":"45_CR11","DOI":"10.1109\/ICDE.1997.582015"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0164-1212(00)00057-1","volume":"53","author":"T. Schreck","year":"2000","unstructured":"Schreck, T., Chen, Z.: Branch Grafting Method for R-tree Implementation. Journal of Systems and Software\u00a053, 83\u201393 (2000)","journal-title":"Journal of Systems and Software"},{"unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: Proceedings of 13th VLDB, Brighton, England, pp. 507\u2013518 (1987)","key":"45_CR13"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-58795-0_54","volume-title":"IGIS \u201994: Geographic Information Systems","author":"Y. Theodoridis","year":"1994","unstructured":"Theodoridis, Y., Sellis, T.: Optimization Issues in R-tree Construction. In: Nievergelt, J., Widmayer, P., Roos, T., Schek, H.-J. (eds.) IGIS 1994. LNCS, vol.\u00a0884, pp. 270\u2013273. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11827405_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:59Z","timestamp":1605644279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11827405_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540378716","9783540378723"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11827405_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}