• The deletion operation in xBR-trees 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A. (2012)
      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 ...
    • Nearest Neighbor Algorithms using xBR-Trees 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A. (2011)
      One of the common queries in spatial databases is the (K) Nearest Neighbor Query that discovers the (K) closest objects to a query object. Processing of spatial queries, in most cases, is accomplished by indexing spatial ...