2012 16th Panhellenic Conference on Informatics (2012)
Piraeus, Greece Greece
Oct. 5, 2012 to Oct. 7, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCi.2012.31
In order to design a spatial index, the most important operations are: insertion, deletion and search. We focus on the deletion operation over the xBR-tree, a spatial data secondary memory structure that belongs to the Quad tree family. The algorithm of handling deletions is presented, taking into account that the deletion of a leaf item may cause entries deletions from internal nodes. The well-known merging technique is applied, to retain the efficiency of the xBR-tree.
Merging, Spatial databases, Vegetation, Distributed Bragg reflectors, Spatial indexes, Indexing, Deletion, Spatial Access Methods, Quadtrees
Antonio Corral, George Roumelis, Michael Vassilakopoulos, "The Deletion Operation in xBR-Trees", 2012 16th Panhellenic Conference on Informatics, vol. 00, no. , pp. 138-143, 2012, doi:10.1109/PCi.2012.31