{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:29:28Z","timestamp":1755217768839,"version":"3.43.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":[[2003,12]]},"DOI":"10.1023\/a:1025521422319","type":"journal-article","created":{"date-parts":[[2003,9,23]],"date-time":"2003-09-23T18:26:26Z","timestamp":1064341586000},"page":"337-354","source":"Crossref","is-referenced-by-count":5,"title":["Performance Evaluation of Lazy Deletion Methods in R-trees"],"prefix":"10.1007","volume":"7","author":[{"given":"Alexandros","family":"Nanopoulos","sequence":"first","affiliation":[]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5144546_CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/69.87964","volume":"1","author":"R.A. Baeza-Yates","year":"1989","unstructured":"R.A. Baeza-Yates and P.A. Larson. \u201cPerformance of B+-Trees with partial expansions,\u201d IEEE Transactions on Knowledge and Data Engineering, Vol. 1(2):248\u2013257, 1989.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. \u201cThe R*-tree: an efficient and Robust access method for points and rectangles,\u201d Proceedings ACM SIGMOD Conference, 322\u2013331, 1990.","key":"5144546_CR2","DOI":"10.1145\/93597.98741"},{"issue":"3","key":"5144546_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1093\/comjnl\/46.3.319","volume":"46","author":"P. Bozanis","year":"2003","unstructured":"P. Bozanis, A. Nanopoulos, and Y. Manolopoulos. \u201cLR-tree: a logarithmic decomposable spatial index method,\u201d \u2329http:\/\/delab.csd.auth.gr\/papers\/BNMtcj03.pdf\u232a, The Computer Journal, Vol. 46(3):319\u2013331,2003.","journal-title":"The Computer Journal"},{"doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cR-trees: A dynamic index structure for spatial searching,\u201d Proceedings ACM SIGMOD Conference, 47\u201357, 1984.","key":"5144546_CR4","DOI":"10.1145\/971697.602266"},{"issue":"2","key":"5144546_CR5","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Guenther. \u201cMultidimensional access methods,\u201d ACM Computing Surveys, Vol. 30(2):170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"unstructured":"Informix Corp.: Informix R-tree Index User's Guide, Version 9.3, 2001.","key":"5144546_CR6"},{"issue":"11","key":"5144546_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0022-0000(93)90020-W","volume":"47","author":"T. Johnson","year":"1993","unstructured":"T. Johnson and D. Shasha. \u201cB-Trees with inserts and deletes: Why free-at-empty is better than merge-at-half,\u201d Journal of Computer and System Sciences, Vol. 47(11):45\u201376, 1993.","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"I. Kamel and C. Faloutsos. \u201cHilbert R-tree: An improved R-tree using fractals,\u201d Proceedings 20th Conference on Very Large Databases (VLDB), 500\u2013509, 1994.","key":"5144546_CR8"},{"doi-asserted-by":"crossref","unstructured":"R. Kothuri, S. Ravada, and D. Abugov. \u201cQuadtree and R-tree indexes in Oracle spatial: A comparison using GIS data,\u201d Proceedings ACM SIGMOD Conference, 546\u2013557, 2002.","key":"5144546_CR9","DOI":"10.1145\/564691.564755"},{"doi-asserted-by":"crossref","unstructured":"Y. Manolopoulos, Y. Theodoridis, and V. Tsotras. Advanced Database Indexing. Kluwer, 2000.","key":"5144546_CR10","DOI":"10.1007\/978-1-4419-8590-3"},{"issue":"1\u20132","key":"5144546_CR11","first-page":"77","volume":"79","author":"Y. Manolopoulos","year":"1994","unstructured":"Y. Manolopoulos. \u201cB-trees with lazy parent split,\u201d Information Sciences, Vol. 79(1\u20132):77\u201388, 1994.","journal-title":"Information Sciences"},{"issue":"5","key":"5144546_CR12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1093\/comjnl\/43.5.420","volume":"43","author":"A. Manousaka","year":"2000","unstructured":"A. Manousaka and Y. Manolopoulos. \u201cFringe analysis of 2\u20133 trees with lazy parent split,\u201d The Computer Journal, Vol. 43(5):420\u2013429, 2000.","journal-title":"The Computer Journal"},{"key":"5144546_CR13","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0306-4379(91)90038-B","volume":"16","author":"G. Matsliach","year":"1991","unstructured":"G. Matsliach. \u201cUsing multi-bucket data leaves with overflow chains\u2014performance analysis,\u201d Information Systems, Vol. 16:497\u2013508, 1991.","journal-title":"Information Systems"},{"unstructured":"V. Ng and T. Kameda. \u201cConcurrent access to R-trees,\u201d Proceedings 4th Symposium on Spatial Databases (SSD), 163\u2013172, 1994.","key":"5144546_CR14"},{"issue":"2","key":"5144546_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y. Sagiv","year":"1986","unstructured":"Y. Sagiv. \u201cConcurrent operations on B*-trees with overtaking,\u201d Journal of Computer and System Sciences, Vol. 33(2):275\u2013296, 1986.","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"S. Ravada and G. Sharma. \u201cOracle8i: Experiences with extensible databases,\u201d Proceedings 6th Symposium on Spatial Databases (SSD), 355\u2013359, 1999.","key":"5144546_CR16","DOI":"10.1007\/3-540-48482-5_21"},{"issue":"1","key":"5144546_CR17","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/319540.319564","volume":"6","author":"M. Scholl","year":"1981","unstructured":"M. Scholl. \u201cNew file organizations based on dynamic hashing,\u201d ACM Transactions on Database Systems, Vol. 6(1):194\u2013211, 1981.","journal-title":"ACM Transactions on Database Systems"},{"unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. \u201cThe R+-tree: A dynamic index for multidimensional objects,\u201d Proceedings 13th Conference on Very Large Databases (VLDB), 89\u2013104, 1987.","key":"5144546_CR18"},{"key":"5144546_CR19","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1093\/comjnl\/34.5.397","volume":"34","author":"B. Srinivasan","year":"1991","unstructured":"B. Srinivasan. \u201cAn adaptive overflow technique to defer splitting in B-trees,\u201d The Computer Journal, Vol. 34:416\u2013425, 1991.","journal-title":"The Computer Journal"},{"doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. \u201cA model for the prediction of R-tree performance,\u201d Proceedings ACM Symposium on Principles of Database Systems (PODS'96), 161\u2013171, 1996.","key":"5144546_CR20","DOI":"10.1145\/237661.237705"},{"issue":"1","key":"5144546_CR21","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/3148.318987","volume":"10","author":"E. Veclerov","year":"1985","unstructured":"E. Veclerov. \u201cAnalysis of dynamic hashing with deferred splitting,\u201d ACM Transactions on Database Systems, Vol. 10(1):90\u201396, 1985.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025521422319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025521422319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025521422319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:02:24Z","timestamp":1754424144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025521422319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["5144546"],"URL":"https:\/\/doi.org\/10.1023\/a:1025521422319","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}