{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:22:48Z","timestamp":1778296968144,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662471","type":"print"},{"value":"9783540484820","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48482-5_8","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:23:24Z","timestamp":1187267004000},"page":"91-108","source":"Crossref","is-referenced-by-count":22,"title":["GBI: A Generalized R-Tree Bulk-Insertion Strategy"],"prefix":"10.1007","author":[{"given":"Rupesh","family":"Choubey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"L. Arge, K. Hinrichs, J. Vahrenhold, and J. Vitter. Efficient Bulk Operations on Dynamic R-trees. Workshop on Algorithm Engineering and Experimentation ALENEX 99, pages 92\u2013103, 1999.","DOI":"10.1007\/3-540-48518-X_20"},{"key":"8_CR2","unstructured":"M. R. Anderberg. Probability and Mathematical Statistics. Academic Press, New York, San Francisco, London, 1973."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"C.H. Ang and T.C. Tan. New Linear Node Splitting Algorithm for R-trees. Advances in Spatial Databases, pages 339\u2013349, 1997.","DOI":"10.1007\/3-540-63238-7_38"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proceedings of SIGMOD, pages 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"8_CR5","unstructured":"J. Bercken, P. Widmayer, and B. Seeger. A Generic Approach to Bulk Loading Multidimensional Index Structures. International Conference on Very Large Data Bases, pages 406\u2013415, 1997."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"L. Chen, R. Choubey, and E. A. Rundensteiner. Bulk Insertions into R-trees using the Small-Tree-Large-Tree Approach. Proceedings of ACM GIS Workshop, pages 161\u2013162, 1998.","DOI":"10.1145\/288692.288722"},{"key":"8_CR7","unstructured":"L. Chen, R. Choubey, and E.A. Rundensteiner. Bulk Insertions into R-Trees. WPI, Tech. Rep. CS-WPI-98-05, February 1998."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"R. Choubey, L. Chen, and E. A. Rundensteiner. GBI: A Generalized R-Tree Bulk Insertion Strategy. WPI Technical Report TR-98-15-STLT, 1998.","DOI":"10.1007\/3-540-48482-5_8"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"W. Chen. Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, pages 587\u2013599, July 1997.","DOI":"10.1109\/69.617052"},{"key":"8_CR10","unstructured":"R. Choubey. R-Tree Bulk Insertion Strategies. Master Thesis in progress, Worcester Polytechnic Institute, 1999."},{"key":"8_CR11","unstructured":"P. Ciaccia and M. Patella. Bulk Loading the M-tree. Proceedings of the Australasian Database Conference, February 1998."},{"key":"8_CR12","volume-title":"Cluster Analysis-A Survey","author":"B. Duran","year":"1974","unstructured":"B. Duran and P. Odell.Cluster Analysis-A Survey. Springer-Verlag, Berlin, Heidelberg, New York, 1974."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. Proceedings of SIGMOD, pages 47\u201357, 1984.","DOI":"10.1145\/602259.602266"},{"key":"8_CR14","unstructured":"Y.W. Huang, N. Jing, and E.A. Rundensteinder. Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. International Conference on Very Large Data Bases, pages 396\u2013405, 1997."},{"key":"8_CR15","unstructured":"Y.W. Huang, M. Jones, and E.A. Rundensteiner. Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins. Proc. of the International Symposium on Spatial Databases, pages 165\u2013177, 1997."},{"key":"8_CR16","unstructured":"Y.W. Huang, N Jing, and E.A. Rundensteiner. A cost model for estimating the performance of spatial joins using R-tree. International Working Conference on Scientific and Statistical Database Management, pages 30\u201338, August 1997."},{"key":"8_CR17","unstructured":"Informix Corporation (\u201c http:\/\/www.informix.com \u201d). Informix. 108"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos. On Packing R-trees. Proceedings of International Conference on Information and Knowledge Management, pages 490\u2013499, November 1993.","DOI":"10.1145\/170088.170403"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"S. Leutenegger, M. Lopez, and J. Edgigton. STR: A Simple and Efficient Algorithm for R-tree Packing. Proceedings of IEEE International Conference on Data Engineering, pages 497\u2013506, 1997.","DOI":"10.1109\/ICDE.1997.582015"},{"key":"8_CR20","unstructured":"S. Leutenegger, M. Lopez, and Y. Garcia. A Greedy Algorithm for Bulk Loading R-trees. Technical report, University of Denver Computer Science Technical Report #97-02, 1997."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"S. Leutenegger and D. Nicol. Efficient Bulk-Loading of Gridles. IEEE Transactions on Knowledge and Data Engineering, pages 410\u2013420, May 1997.","DOI":"10.1109\/69.599930"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"J. Li, D. Rotem, and J. Srivastave. Algorithms for Loading Parallel Gridles. Proceedings of SIGMOD, pages 347\u2013356, 1993.","DOI":"10.1145\/170036.170086"},{"key":"8_CR23","unstructured":"MapInfo Corporation. SpatialWare- http:\/\/www.mapinfo.com\/spatialware\/spatial20.html ."},{"key":"8_CR24","unstructured":"A. Moitra. Spatio-Temporal Data Management Using R-trees. International Journal of Geographic Information Systems, 1993."},{"key":"8_CR25","volume-title":"Cluster Analysis for Researchers","author":"H. Romesburg","year":"1984","unstructured":"H.Charles Romesburg. Cluster Analysis for Researchers. Lifetime Learning Publications, Belmont, California, 1984."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, M. Roussopoulos, and Y. Kotidis. Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. Proceedings of SIGMOD, pages 89\u201399, 1997.","DOI":"10.1145\/253260.253276"},{"key":"8_CR27","volume-title":"Cluster Analysis Algorithms for Data Reduction and Classification of Objects","author":"H. Spath","year":"1982","unstructured":"H. Spath. Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwook Publishers, Chichester, 1982."},{"key":"8_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-58795-0_54","volume-title":"Optimization Issues in R-tree Construction (extended abstract)","author":"Y. Theodoridis","year":"1994","unstructured":"Y. Theodoridis and T. Sellis. Optimization Issues in R-tree Construction (extended abstract). Lecture Notes in Computer Science, pages 270\u2013273, 1994."},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"236","DOI":"10.2307\/2282967","volume":"58","author":"J. H. Ward","year":"1963","unstructured":"J. H. Ward. Hierarchical Grouping Analysis For Applications. Journal of American Statistics Association, 58:236\u2013244, 1963.","journal-title":"Journal of American Statistics Association"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48482-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:24:33Z","timestamp":1684009473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48482-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662471","9783540484820"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-48482-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}