The deletion operation in xBR-trees
dc.creator | Roumelis, G. | en |
dc.creator | Vassilakopoulos, M. | en |
dc.creator | Corral, A. | en |
dc.date.accessioned | 2015-11-23T10:46:35Z | |
dc.date.available | 2015-11-23T10:46:35Z | |
dc.date.issued | 2012 | |
dc.identifier | 10.1109/PCi.2012.31 | |
dc.identifier.isbn | 9780769548258 | |
dc.identifier.uri | http://hdl.handle.net/11615/32698 | |
dc.description.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. © 2012 IEEE. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-84872243413&partnerID=40&md5=bce76f144db3bba1c01ce362047a84d1 | |
dc.subject | Deletion | en |
dc.subject | Quadtrees | en |
dc.subject | Spatial Access Methods | en |
dc.subject | Internal nodes | en |
dc.subject | Merging techniques | en |
dc.subject | Quad trees | en |
dc.subject | Secondary memories | en |
dc.subject | Spatial data | en |
dc.subject | Spatial indices | en |
dc.subject | Information science | en |
dc.subject | Interfaces (computer) | en |
dc.title | The deletion operation in xBR-trees | en |
dc.type | conferenceItem | en |
Αρχεία σε αυτό το τεκμήριο
Αρχεία | Μέγεθος | Τύπος | Προβολή |
---|---|---|---|
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο. |