{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:51Z","timestamp":1778249751006,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441380","type":"print"},{"value":"9783540457107","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45710-0_13","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T20:29:40Z","timestamp":1181680180000},"page":"149-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Revisiting R-Tree Construction Principles"],"prefix":"10.1007","author":[{"given":"Sotiris","family":"Brakatsoulas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Pfoser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"13_CR1","unstructured":"M.R. Anderberg. Cluster Analysis for Applications. Academic Press, 1973."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1006\/jagm.1996.0057","volume":"21","author":"B. Becker","year":"1996","unstructured":"B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler, and P. Widmayer. Enclosing aset of objects by two minimum arearectangles. Journal of Algorithms 21:520\u2013541, 1996.","journal-title":"Journal of Algorithms"},{"key":"13_CR3","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. In Proceedings ACM SIGMOD Conference pages 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"13_CR4","series-title":"Technical report","volume-title":"Revisiting R-tree construction principles","author":"S. Brakatsoulas","year":"2002","unstructured":"S. Brakatsoulas, D. Pfoser, and Y. Theodoridis. Revisiting R-tree construction principles. Technical report, Computer Technology Institute, Patras, Greece, 2002. http:\/\/dias.cti.gr\/~pfoser\/clustering.pdf"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"R. Choubey, L. Chen, and E.A. Rundensteiner. GBI: A generalized R-tree bulk-insertion strategy. In Proceedings SSD Symposium, pages 91\u2013108, 1999.","DOI":"10.1007\/3-540-48482-5_8"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121\u2013127, 1979.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther. Multidimensional access methods. ACM Computing Surveys 30(2):381\u2013399, 1998.","journal-title":"ACM Computing Surveys"},{"key":"13_CR8","unstructured":"Y.J. Garcia, M.A. Lopez, and S.T. Leutenegger. On optimal node splitting for R-trees. In Proceedings 24th VLDB Conference, pages 334\u2013344, 1998."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings ACM SIGMOD Conference, pages 47\u201357, 1984.","DOI":"10.1145\/971697.602266"},{"key":"13_CR10","unstructured":"J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001."},{"key":"13_CR11","unstructured":"J. Hellerstein, J. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proceedings 21st VLDB Conference, pages 562\u2013573, 1995."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"A.K. Jain, M.N. Murty, and P.J. Flynn. Data clustering: A review. ACM Computting Surveys, 31(3):264\u2013323, 1999.","journal-title":"ACM Computting Surveys"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"L. Kaufman and P. Rousseeuw. Finding Groups in Data: an Introduction to Cluster Analysis. Wiley, 1990.","DOI":"10.1002\/9780470316801"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"S. Leutenegger, M. Lopez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proceedings 12th IEEE ICDE Conference, pages 497\u2013506, 1997.","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02294245","volume":"50","author":"G. Milligan","year":"1985","unstructured":"G. Milligan and M. Cooper. An examination of procedures for determining the number of clusters in a dataset. Psychometrica 50(2):159\u2013179, 1985.","journal-title":"Psychometrica"},{"key":"13_CR16","unstructured":"J. O\u2019Rourke. Computational Geometry in C. Cambridge University Press, second edition, 1998."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance. In Proceedings 12th ACM PODS Symposium, 1993.","DOI":"10.1145\/153850.153878"},{"key":"13_CR18","unstructured":"D. Pfoser, C.S. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proceedings 26th VLDB Conference, pages 395\u2013406, 2000."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for arge databases. In Proceedings ACM SIGMOD Conference, pages 73\u201384, 1998.","DOI":"10.1145\/276304.276312"},{"key":"13_CR20","unstructured":"S. Theodoridis and K. Koutroumbas. Pattern Recognition. Academic Press, 1999."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. Optimization issues in R-tree construction. In Proceedings International Workshop on Geographic Information Systems, pages 270\u2013273, 1994.","DOI":"10.1007\/3-540-58795-0_54"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. A mode for the prediction of r-tree performance. In Proceedings 15th ACM PODS Symposium, pages 161\u2013171, 1996.","DOI":"10.1145\/237661.237705"},{"key":"13_CR23","unstructured":"Leejay Wu and C. Faloutsos. Fracdim. Web site, 2001. URL: http:\/\/www.andrew.cmu.edu\/~lw2j\/downloads.html current as of Sept.30, 2001."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, and M. Linvy. An efficient data clustering method for very large databases. In Proceedings ACM SIGMOD Conference, pages 103\u201311, 1996.","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45710-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:46:17Z","timestamp":1778247977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45710-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441380","9783540457107"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45710-0_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}