dc.creator | Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. | en |
dc.date.accessioned | 2023-01-31T09:52:02Z | |
dc.date.available | 2023-01-31T09:52:02Z | |
dc.date.issued | 2017 | |
dc.identifier | 10.1007/978-3-319-66854-3_14 | |
dc.identifier.isbn | 9783319668536 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://hdl.handle.net/11615/78583 | |
dc.description.abstract | Bulk insertion refers to the process of updating an existing index by inserting a large batch of new data, treating the items of this batch as a whole and not by inserting these items one-by-one. Bulk insertion is related to bulk loading, which refers to the process of creating a non-existing index from scratch, when the dataset to be indexed is available beforehand. The xBR+-tree is a balanced, disk-resident, Quadtree-based index for point data, which is very efficient for processing spatial queries. In this paper, we present the first algorithm for bulk insertion into xBR+-trees. This algorithm incorporates extensions of techniques that we have recently developed for bulk loading xBR+-trees. Moreover, using real and artificial datasets of various cardinalities, we present an experimental comparison of this algorithm vs. inserting items one-by-one for updating xBR+-trees, regarding performance (I/O and execution time) and the characteristics of the resulting trees. We also present experimental results regarding the query-processing efficiency of xBR+-trees built by bulk insertions vs. xBR+-trees built by inserting items one-by-one. © 2017, Springer International Publishing AG. | en |
dc.language.iso | en | en |
dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85030698736&doi=10.1007%2f978-3-319-66854-3_14&partnerID=40&md5=bafaa3aae77e1929c41d948335f1b5d9 | |
dc.subject | Forestry | en |
dc.subject | Query processing | en |
dc.subject | Artificial datasets | en |
dc.subject | Bulk loading | en |
dc.subject | Bulk-inserting | en |
dc.subject | Cardinalities | en |
dc.subject | Experimental comparison | en |
dc.subject | Spatial indexes | en |
dc.subject | Spatial queries | en |
dc.subject | xBR^+-trees | en |
dc.subject | Trees (mathematics) | en |
dc.subject | Springer Verlag | en |
dc.title | Bulk insertions into xBR+-trees | en |
dc.type | conferenceItem | en |