The Community for Technology Leaders
2012 16th Panhellenic Conference on Informatics (2012)
Piraeus, Greece Greece
Oct. 5, 2012 to Oct. 7, 2012
ISBN: 978-1-4673-2720-6
pp: 138-143
ABSTRACT
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.
INDEX TERMS
Merging, Spatial databases, Vegetation, Distributed Bragg reflectors, Spatial indexes, Indexing, Deletion, Spatial Access Methods, Quadtrees
CITATION

A. Corral, G. Roumelis and M. Vassilakopoulos, "The Deletion Operation in xBR-Trees," 2012 16th Panhellenic Conference on Informatics(PCI), Piraeus, Greece Greece, 2012, pp. 138-143.
doi:10.1109/PCi.2012.31
94 ms
(Ver 3.3 (11022016))