{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:51:36Z","timestamp":1750830696179,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:00:00Z","timestamp":1552348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["[TIN2013-41576-R]","[TIN2017-83964-R]"],"award-info":[{"award-number":["[TIN2013-41576-R]","[TIN2017-83964-R]"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["[TIN2013-41576-R]","[TIN2017-83964-R]"],"award-info":[{"award-number":["[TIN2013-41576-R]","[TIN2017-83964-R]"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"crossref","award":["[TIN2013-41576-R]","[TIN2017-83964-R]"],"award-info":[{"award-number":["[TIN2013-41576-R]","[TIN2017-83964-R]"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00607-019-00709-4","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T05:24:08Z","timestamp":1552368248000},"page":"1539-1563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Bulk-loading and bulk-insertion algorithms for \n                \n                  \n                \n                $$\\hbox {xBR}^{+}\\hbox {-trees}$$\n                \n                  \n                    \n                      \n                        xBR\n                        +\n                      \n                      -trees\n                    \n                  \n                \n               in Solid State Drives"],"prefix":"10.1007","volume":"101","author":[{"given":"George","family":"Roumelis","sequence":"first","affiliation":[]},{"given":"Athanasios","family":"Fevgas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2256-5523","authenticated-orcid":false,"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[]},{"given":"Panayiotis","family":"Bozanis","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,12]]},"reference":[{"key":"709_CR1","doi-asserted-by":"crossref","unstructured":"Achakeev D, Seeger B, Widmayer P (2012) Sort-based query-adaptive loading of R-trees. In: CIKM conference, pp 2080\u20132084","DOI":"10.1145\/2396761.2398577"},{"key":"709_CR2","doi-asserted-by":"crossref","unstructured":"Achakeev D, Seidemann M, Schmidt M, Seeger B (2012) Sort-based parallel loading of R-trees. In: BigSpatial workshop, pp 62\u201370","DOI":"10.1145\/2447481.2447489"},{"key":"709_CR3","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/B978-012722442-8\/50088-4","volume-title":"Proceedings 2003 VLDB Conference","author":"Ning An","year":"2003","unstructured":"An N, Kanth KVR, Ravada S (2003) Improving performance with bulk-inserts in Oracle R-trees. In: VLDB conference, pp 948\u2013951"},{"key":"709_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-48518-X_20","volume-title":"Algorithm Engineering and Experimentation","author":"Lars Arge","year":"1999","unstructured":"Arge L, Hinrichs KH, Vahrenhold J, Vitter JS (1999) Efficient bulk operations on dynamic R-trees. In: ALENEX workshop, pp 328\u2013348"},{"issue":"1","key":"709_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-001-0107-6","volume":"33","author":"L Arge","year":"2002","unstructured":"Arge L, Hinrichs KH, Vahrenhold J, Vitter JS (2002) Efficient bulk operations on dynamic R-trees. Algorithmica 33(1):104\u2013128","journal-title":"Algorithmica"},{"key":"709_CR6","first-page":"216","volume-title":"Lecture Notes in Computer Science","author":"Stefan Berchtold","year":"1998","unstructured":"Berchtold S, B\u00f6hm C, Kriegel H (1998) Improving the query performance of high-dimensional index structures by bulk-load operations. In: EDBT conference, pp 216\u2013230"},{"key":"709_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-66917-5_16","volume-title":"Advances in Databases and Information Systems","author":"Anderson Chaves Carniel","year":"2017","unstructured":"Carniel AC, Ciferri RR, de\u00a0Aguiar\u00a0Ciferri CD (2017) A generic and efficient framework for spatial indexing on flash-based solid state drives. In: ADBIS conference, pp 229\u2013243"},{"key":"709_CR8","doi-asserted-by":"crossref","unstructured":"Chen L, Choubey R, Rundensteiner EA (1998) Bulk-insertions info R-trees using the small-tree-large-tree approach. In: ACM-GIS conference, pp 161\u2013162","DOI":"10.1145\/288692.288722"},{"issue":"1","key":"709_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1013764014000","volume":"6","author":"L Chen","year":"2002","unstructured":"Chen L, Choubey R, Rundensteiner EA (2002) Merging R-trees: efficient strategies for local bulk insertion. GeoInformatica 6(1):7\u201334","journal-title":"GeoInformatica"},{"key":"709_CR10","doi-asserted-by":"crossref","unstructured":"Cho S, Chang S, Jo I (2015) The solid-state drive technology, today and tomorrow. In: ICDE conference, pp 1520\u20131522","DOI":"10.1109\/ICDE.2015.7113416"},{"key":"709_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-48482-5_8","volume-title":"Advances in Spatial Databases","author":"Rupesh Choubey","year":"1999","unstructured":"Choubey R, Chen L, Rundensteiner EA (1999) GBI: A generalized R-tree bulk-insertion strategy. In: SSD conference, pp 91\u2013108"},{"key":"709_CR12","unstructured":"Ciaccia P, Patella M (1998) Bulk loading the M-tree. In: ADC conference, pp 15\u201326"},{"issue":"12","key":"709_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/2380656.2380672","volume":"55","author":"M Cornwell","year":"2012","unstructured":"Cornwell M (2012) Anatomy of a solid-state drive. Commun ACM 55(12):59\u201363","journal-title":"Commun ACM"},{"key":"709_CR14","unstructured":"den Bercken JV, Seeger B (2001) An evaluation of generic bulk loading techniques. In: VLDB conference, pp 461\u2013470"},{"key":"709_CR15","unstructured":"den Bercken JV, Seeger B, Widmayer P (1997) A generic approach to bulk loading multidimensional index structures. In: VLDB conference, pp 406\u2013415"},{"key":"709_CR16","doi-asserted-by":"crossref","unstructured":"Emrich T, Graf F, Kriegel H, Schubert M, Thoma M (2010) On the impact of flash SSDs on spatial indexing. In: DaMoN conference, pp 3\u20138","DOI":"10.1145\/1869389.1869390"},{"key":"709_CR17","first-page":"285","volume-title":"Lecture Notes in Computer Science","author":"Athanasios Fevgas","year":"2015","unstructured":"Fevgas A, Bozanis P (2015) Grid-file: towards to a flash efficient multi-dimensional index. In: DEXA conference, pp 285\u2013294"},{"key":"709_CR18","doi-asserted-by":"crossref","unstructured":"Ghanem TM, Shah R, Mokbel MF, Aref WG, Vitter JS (2004) Bulk operations for space-partitioning trees. In: ICDE conference, pp 29\u201340","DOI":"10.1109\/ICDE.2004.1319982"},{"issue":"9","key":"709_CR19","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1109\/JPROC.2017.2731776","volume":"105","author":"FT Hady","year":"2017","unstructured":"Hady FT, Foong AP, Veal B, Williams D (2017) Platform storage performance with 3d XPoint technology. Proc IEEE 105(9):1822\u20131833","journal-title":"Proc IEEE"},{"key":"709_CR20","unstructured":"Hjaltason GR, Samet H (1999) Improved bulk-loading algorithms for quadtrees. In: ACM-GIS conference, pp 110\u2013115"},{"issue":"2","key":"709_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00778-002-0067-8","volume":"11","author":"GR Hjaltason","year":"2002","unstructured":"Hjaltason GR, Samet H (2002) Speeding up construction of PMR quadtree-based spatial indexes. VLDB J 11(2):109\u2013137","journal-title":"VLDB J"},{"key":"709_CR22","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H, Sussmann YJ (1997) Speeding up bulk-loading of quadtrees. In: ACM-GIS conference, pp 50\u201353","DOI":"10.1145\/267825.267839"},{"key":"709_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.datak.2011.09.007","volume":"72","author":"P Jin","year":"2012","unstructured":"Jin P, Ou Y, Harder T, Li Z (2012) AD-lRU: an efficient buffer replacement algorithm for flash-based databases. Data Knowl Eng 72:83\u2013102","journal-title":"Data Knowl Eng"},{"issue":"10","key":"709_CR24","doi-asserted-by":"publisher","first-page":"4676","DOI":"10.1016\/j.eswa.2015.01.011","volume":"42","author":"P Jin","year":"2015","unstructured":"Jin P, Xie X, Wang N, Yue L (2015) Optimizing R-tree for flash memory. Expert Syst Appl 42(10):4676\u20134686","journal-title":"Expert Syst Appl"},{"key":"709_CR25","doi-asserted-by":"crossref","unstructured":"Kamel I, Faloutsos C (1993) On packing R-trees. In: CIKM conference, pp 490\u2013499","DOI":"10.1145\/170088.170403"},{"key":"709_CR26","unstructured":"Kamel I, Khalil M, Kouramajian V (1996) Bulk insertion in dynamic R-trees. In: SDH conference, pp 3B.31\u20133B.42"},{"key":"709_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-22922-0_28","volume-title":"Advances in Spatial and Temporal Databases","author":"Ioannis Koltsidas","year":"2011","unstructured":"Koltsidas I, Viglas SD (2011) Spatial data management over flash memory. In: SSTD conference, pp 449\u2013453"},{"issue":"1","key":"709_CR28","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.datak.2005.07.011","volume":"59","author":"T Lee","year":"2006","unstructured":"Lee T, Moon B, Lee S (2006) Bulk insertion for R-trees by seeded clustering. Data Knowl Eng 59(1):86\u2013106","journal-title":"Data Knowl Eng"},{"key":"709_CR29","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Edgington JM, Lopez MA (1997) STR: a simple and efficient algorithm for R-tree packing. In: ICDE conference, pp 497\u2013506","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"3","key":"709_CR30","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s11227-011-0679-0","volume":"64","author":"G Li","year":"2013","unstructured":"Li G, Zhao P, Yuan L, Gao S (2013) Efficient implementation of a multi-dimensional index structure over flash memory storage systems. J Supercomput 64(3):1055\u20131074","journal-title":"J Supercomput"},{"key":"709_CR31","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-20244-5_20","volume-title":"Database Systems for Adanced Applications","author":"Yanfei Lv","year":"2011","unstructured":"Lv Y, Li J, Cui B, Chen X (2011) Log-compact R-tree: an efficient spatial index for SSD. In: DASFAA workshops, pp 202\u2013213"},{"issue":"10","key":"709_CR32","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.parco.2003.05.003","volume":"29","author":"A Papadopoulos","year":"2003","unstructured":"Papadopoulos A, Manolopoulos Y (2003) Parallel bulk-loading of spatial data. Parallel Comput 29(10):1419\u20131444","journal-title":"Parallel Comput"},{"key":"709_CR33","doi-asserted-by":"crossref","unstructured":"Park S, Jung D, Kang J, Kim J, Lee J (2006) CFLRU: a replacement algorithm for flash memory. In: Proceedings of the 2006 international conference on compilers, architecture and synthesis for embedded systems. ACM, pp 234\u2013241","DOI":"10.1145\/1176760.1176789"},{"key":"709_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-29023-7_7","volume-title":"Database Systems for Advanced Applications","author":"Maciej Pawlik","year":"2012","unstructured":"Pawlik M, Macyna W (2012) Implementation of the aggregated R-tree over flash memory. In: DASFAA workshops, pp 65\u201372"},{"issue":"4","key":"709_CR35","first-page":"286","volume":"5","author":"H Roh","year":"2011","unstructured":"Roh H, Park S, Kim S, Shin M, Lee S (2011) B\n                    \n                      \n                    \n                    $$^{+}$$\n                    \n                      \n                        \n                          \n                          +\n                        \n                      \n                    \n                  -tree index optimization by exploiting internal parallelism of flash-based solid state drives. PVLDB 5(4):286\u2013297","journal-title":"PVLDB"},{"key":"709_CR36","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-23737-9_17","volume-title":"Advances in Databases and Information Systems","author":"George Roumelis","year":"2011","unstructured":"Roumelis G, Vassilakopoulos M, Corral A (2011) Performance comparison of xBR-trees and R*-trees for single dataset spatial queries. In: ADBIS conference, pp 228\u2013242"},{"key":"709_CR37","doi-asserted-by":"crossref","unstructured":"Roumelis G, Vassilakopoulos M, Corral A, Manolopoulos Y (2016) Bulk-loading xBR\n                    \n                      \n                    \n                    $$^+$$\n                    \n                      \n                        \n                          \n                          +\n                        \n                      \n                    \n                  -trees. In: MEDI conference, pp 57\u201371","DOI":"10.1007\/978-3-319-45547-1_5"},{"key":"709_CR38","doi-asserted-by":"crossref","unstructured":"Roumelis G, Vassilakopoulos M, Corral A, Manolopoulos Y (2017) Bulk insertions into xBR\n                    \n                      \n                    \n                    $$^+$$\n                    \n                      \n                        \n                          \n                          +\n                        \n                      \n                    \n                  -trees. In: MEDI conference, pp 185\u2013199","DOI":"10.1007\/978-3-319-66854-3_14"},{"key":"709_CR39","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.jss.2017.07.005","volume":"132","author":"G Roumelis","year":"2017","unstructured":"Roumelis G, Vassilakopoulos M, Corral A, Manolopoulos Y (2017) Efficient query processing on large spatial databases: a performance study. J Syst Softw 132:165\u2013185","journal-title":"J Syst Softw"},{"key":"709_CR40","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.csi.2017.05.003","volume":"57","author":"G Roumelis","year":"2018","unstructured":"Roumelis G, Vassilakopoulos M, Corral A, Manolopoulos Y (2018) An efficient algorithm for bulk-loading xBR\n                    \n                      \n                    \n                    $$^+$$\n                    \n                      \n                        \n                          \n                          +\n                        \n                      \n                    \n                  -trees. Comput Stand Interfaces 57:83\u2013100","journal-title":"Comput Stand Interfaces"},{"key":"709_CR41","first-page":"43","volume-title":"Lecture Notes in Computer Science","author":"George Roumelis","year":"2015","unstructured":"Roumelis G, Vassilakopoulos M, Loukopoulos T, Corral A, Manolopoulos Y (2015) The xBR\n                    \n                      \n                    \n                    $$^+$$\n                    \n                      \n                        \n                          \n                          +\n                        \n                      \n                    \n                  -tree: an efficient access method for points. In: DEXA conference, pp 43\u201358"},{"issue":"2","key":"709_CR42","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/253262.253276","volume":"26","author":"Nick Roussopoulos","year":"1997","unstructured":"Roussopoulos N, Kotidis Y, Roussopoulos M (1997) Cubetree: Organization of and bulk updates on the data cube. In: SIGMOD conference, pp 89\u201399","journal-title":"ACM SIGMOD Record"},{"issue":"4","key":"709_CR43","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/971699.318900","volume":"14","author":"Nick Roussopoulos","year":"1985","unstructured":"Roussopoulos N, Leifker D (1985) Direct spatial search on pictorial databases using packed R-trees. In: SIGMOD conference, pp 17\u201331","journal-title":"ACM SIGMOD Record"},{"key":"709_CR44","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-22922-0_10","volume-title":"Advances in Spatial and Temporal Databases","author":"Mohamed Sarwat","year":"2011","unstructured":"Sarwat M, Mokbel MF, Zhou X, Nath S (2011) FAST: a generic framework for flash-aware spatial trees. In: SSTD conference, pp 149\u2013167"},{"key":"709_CR45","volume-title":"Spatial databases\u2014a tour","author":"S Shekhar","year":"2003","unstructured":"Shekhar S, Chawla S (2003) Spatial databases\u2014a tour. Prentice Hall, Upper Saddle River"},{"key":"709_CR46","doi-asserted-by":"publisher","unstructured":"Vassilakopoulos M, Manolopoulos Y (2000) External balanced regular (x-BR) trees: new structures for very large spatial databases. In: Fotiadis DI, Nikolopoulos SD (eds) Advances in informatics: selected papers of the 7th hellenic conference on informatics (HCI \u201999). World Scientific, Singapore, pp 324\u2013333. \n                    https:\/\/doi.org\/10.1142\/9789812793928_0029","DOI":"10.1142\/9789812793928_0029"},{"issue":"5","key":"709_CR47","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.is.2009.07.002","volume":"35","author":"TG Vespa","year":"2010","unstructured":"Vespa TG, Traina C Jr, Traina AJM (2010) Efficient bulk-loading ondynamic metric access methods. Inf Syst 35(5):557\u2013569","journal-title":"Inf Syst"},{"key":"709_CR48","doi-asserted-by":"crossref","unstructured":"Wu C, Chang L, Kuo T (2003) An efficient R-tree implementation over flash-memory storage systems. In: ACM-GIS conference, pp 17\u201324","DOI":"10.1145\/956676.956679"},{"issue":"1","key":"709_CR49","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10766-014-0340-7","volume":"44","author":"C Yang","year":"2016","unstructured":"Yang C, Jin P, Yue L, Yang P (2016) Efficient buffer management for tree indexes on solid state drives. Int J Parallel Program 44(1):5\u201325","journal-title":"Int J Parallel Program"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00709-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-019-00709-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00709-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T20:19:46Z","timestamp":1583871586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-019-00709-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,12]]},"references-count":49,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s00607-019-00709-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2019,3,12]]},"assertion":[{"value":"19 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}