{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:44:48Z","timestamp":1766065488642,"version":"3.43.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GeoInformatica"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1023\/a:1013764014000","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:20:10Z","timestamp":1040664010000},"page":"7-34","source":"Crossref","is-referenced-by-count":18,"title":["Merging R-Trees: Efficient Strategies for Local Bulk Insertion"],"prefix":"10.1007","volume":"6","author":[{"given":"Li","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupesh","family":"Choubey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"393739_CR1","doi-asserted-by":"crossref","unstructured":"C.H. Ang and T.C. Tan. \u201cNew linar node splitting algorithm for R-trees,\u201d Advances in Spatial Databases, 339\u2013349, 1997.","DOI":"10.1007\/3-540-63238-7_38"},{"key":"393739_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-54414-3_43","volume-title":"Advances in Spatial Databases LNCS 525","author":"B. Seeger","year":"1991","unstructured":"B. Seeger. Advances in Spatial Databases LNCS 525. Springer-Verlag: Berlin\/Heidelberg: New York, 277\u2013296, 1991."},{"key":"393739_CR3","unstructured":"B.C. Ooi, K.J. Mcdonnell, and R. Sacks-Davis. \u201cSpatial kd-tree: An indexing mechanism for spatial databases,\u201d in Proceedings of the IEEE Computer Software and Applications Conference, 433\u2013438, 1987."},{"key":"393739_CR4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneder, and B. Seeger. \u201cThe R*-tree: an efficient and robust access method for points and rectangles,\u201d Proceedings of SIGMOD, 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"393739_CR5","unstructured":"J. Bercken, P. Widmayer, and B. Seeger. \u201cA generic approach to bulk loading multidimensional index structures,\u201d Internatinal Conference on Very Large Data Bases, 406\u2013415, 1997."},{"key":"393739_CR6","doi-asserted-by":"crossref","unstructured":"C. Bhm and H.P. Kriegel. \u201cEfficient bulk loading of large high-dimensional indexes,\u201d Data Warehousing and Knowledge Discovery, 251\u2013260, 1999.","DOI":"10.1007\/3-540-48298-9_27"},{"key":"393739_CR7","doi-asserted-by":"crossref","unstructured":"W. Chen. \u201cProgramming with logical queries, bulk updates, and hypothetical reasoning,\u201d IEEE Transactions of Knowledge and Data Engineering, 587\u2013599, July 1997.","DOI":"10.1109\/69.617052"},{"key":"393739_CR8","doi-asserted-by":"crossref","unstructured":"R. Choubey, L. Chen, and E.A. Rundensteiner. \u201cGBI: A generalized R-Tree bulk-insertion strategy,\u201d WPI Technical Report\u2014TR\u201398\u201315-STLT, 1998.","DOI":"10.1007\/3-540-48482-5_8"},{"key":"393739_CR9","unstructured":"P. Ciaccia and M. Patella. \u201cBulk loading the M-tree,\u201d Proceedings of the Australasian Database Conference, February 1998."},{"key":"393739_CR10","doi-asserted-by":"crossref","unstructured":"D.B. Lomet and B. Salzberg. \u201cThe hB-tree: A robust multiattribute search structure,\u201d in Proceedings of the fifth IEEE Inter-national Conference on Data Engineering, 296\u2013304, 1989.","DOI":"10.1109\/ICDE.1989.47229"},{"key":"393739_CR11","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and I. Kamel. \u201cBeyond uniformity and independance: Analysis of R-tree using the concept of fractal dimension,\u201d Proceedings of SIGMOD, 4\u201313, 1994.","DOI":"10.1145\/182591.182593"},{"key":"393739_CR12","doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cR-trees: A dynamic index structure for spatial searching,\u201d Proceedings of SIGMOD, 47\u201357, 1984.","DOI":"10.1145\/971697.602266"},{"key":"393739_CR13","unstructured":"Y.W. Huang, N. Jing, and E.A. Rundensteiner. \u201cA cost model for estimating the performance of spatial joins using R-tree,\u201d International Working Confernece on Scientific and Statistical Database Management, 30\u201338, August 1997."},{"key":"393739_CR14","unstructured":"I. Kamel and C. Faloutsos. \u201cHilbert R-tree: An improved R-tree using fractals,\u201d in Proceedings of the Twentieth International Conference on Very Large Data Bases, 500\u2013509, 1994."},{"key":"393739_CR15","doi-asserted-by":"crossref","unstructured":"J. Li, D. Rotem, and J. Srivastava. \u201cAlgorithms for loading parallel gridfiles,\u201d Proceedings of SIGMOD, 347\u2013356, 1998.","DOI":"10.1145\/170035.170086"},{"key":"393739_CR16","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos. \u201cOn packing R-trees,\u201d Proceedings of International Conference on Information and Knowledge Management, 490\u2013499, November 1993.","DOI":"10.1145\/170088.170403"},{"key":"393739_CR17","doi-asserted-by":"crossref","unstructured":"L. Arge. \u201cThe buffer tree: A new technique for optimal I\/O algorithms,\u201d in Proc. Workshop on Algorithms and Data Structures, LNCS 955, 334\u2013345, 1995.","DOI":"10.1007\/3-540-60220-8_74"},{"key":"393739_CR18","doi-asserted-by":"crossref","unstructured":"L. Arge, K. Hinrichs, J. Vahrenhold, and J. Vitter. \u201cEfficient bulk operations on dynamic R-trees,\u201d Algorithm Engineering and Experimentation, International Workshop (ALENEX), Baltimore, MD, USA, 328\u2013348, 1999.","DOI":"10.1007\/3-540-48518-X_20"},{"key":"393739_CR19","doi-asserted-by":"crossref","unstructured":"L. Chen, R. Choubey, and E.A. Rundensteiner. \u201cBulk insertions into R-trees using the small-tree-large-tree approach,\u201d Proceedings of ACM GIS Workshop, 1998.","DOI":"10.1145\/288692.288722"},{"issue":"2","key":"393739_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0306-4379(86)90005-0","volume":"11","author":"S.D. Lang","year":"1986","unstructured":"S.D. Lang, J.R. Driscoll, and J.H. Jou. \u201cBatch insertion for tree structured file organizations-improving differential database representation,\u201d Information Systems, Vol. 11(2):167\u2013175, 1986.","journal-title":"Information Systems"},{"key":"393739_CR21","doi-asserted-by":"crossref","unstructured":"S. Leutenegger and M. Lopez. \u201cThe Effect of buffering on the performance of R-Trees,\u201d Proceedings of IEEE International Conference on Data Engineering, 164\u2013483, 1998.","DOI":"10.1109\/ICDE.1998.655772"},{"key":"393739_CR22","unstructured":"S. Leutenegger, M. Lopez, and J. Edgigton. \u201cSTR: A simple and efficient algorithm for R-tree packing,\u201d Proceedings of IEEE International Conference on Data Engineering, 497\u2013506, 1997."},{"key":"393739_CR23","unstructured":"S. Leutenegger, M. Lopez, and Y. Garcia. \u201cA greedy algorithm for bulk loading R-trees,\u201d Technical report, University of Denver Computer Science (Technical Report # 97\u201302), 1997."},{"key":"393739_CR24","doi-asserted-by":"crossref","unstructured":"S. Leutenegger and D. Nicol. \u201cEfficient bulk-loading of gridfiles,\u201d IEEE Transactions on Knowledge and Data Engineering, 410\u2013420, May 1997.","DOI":"10.1109\/69.599930"},{"key":"393739_CR25","doi-asserted-by":"crossref","unstructured":"K.P. Malmi, E. Soininen, and T. Ylonen. \u201cConcurrency control in B-Trees with batch updates,\u201d IEEE Transactions on Knowledge and Data Engineering, 975\u2013983, 1996.","DOI":"10.1109\/69.553166"},{"key":"393739_CR26","unstructured":"A. Moitra. \u201cSpatio-temporal data management using R-trees,\u201d International Journal of Geographic Information Systems, 1993."},{"key":"393739_CR27","unstructured":"B. Ooi. \u201cEfficient query processing in geographic information systems,\u201d Lecture Notes in Computer Science, 1990."},{"key":"393739_CR28","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos and D. Leifker. \u201cDirect spatial search on pictorial databases using packed R-trees,\u201d Proceedings of SIGMOD 17\u201332, 1985.","DOI":"10.1145\/318898.318900"},{"key":"393739_CR29","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, M. Roussopoulos, and Y. Kotidis. \u201cCubetree: organization of and bulk incremental updates on the data cube,\u201d Proceedings of SIGMOD, 89\u201399, 1997.","DOI":"10.1145\/253262.253276"},{"key":"393739_CR30","doi-asserted-by":"crossref","unstructured":"J. Srivastava and C.V. Ramamoorthy. \u201cEfficient algorithms for maintenance of large database indexes,\u201d Proceedings of IEEE International Conference on Data Engineering, 402\u2013409, 1988.","DOI":"10.1109\/ICDE.1988.105484"},{"key":"393739_CR31","unstructured":"T. Sellis, N. Roussopoulos and C. Faloutsos. \u201cR+-tree: A dynamic index for multi-dimensional objects,\u201d in Proceedings of the Thirteenth International Conference on Very Large Data bases, 507\u2013518, 1987."},{"key":"393739_CR32","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. \u201cOptimization issues in R-tree construction (extended abstract),\u201d Lecture Notes in Computer Science, 270\u2013273, 1994.","DOI":"10.1007\/3-540-58795-0_54"},{"key":"393739_CR33","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther. \u201cMultidimensional access methods,\u201d ACM Computer Surveys, Vol. 30:170\u2013231, 1998.","journal-title":"ACM Computer Surveys"},{"key":"393739_CR34","unstructured":"J.L. Wiener and J.F. Naughton. \u201cBulk loading into an OODB: A performance study,\u201d International Conference on Very Large Data Bases, 120\u2013131, 1994."}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013764014000.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013764014000\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013764014000.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:17:13Z","timestamp":1754425033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013764014000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["393739"],"URL":"https:\/\/doi.org\/10.1023\/a:1013764014000","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}