Symmetric M-tree - Computer Science > DatabasesReportar como inadecuado

Symmetric M-tree - Computer Science > Databases - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The M-tree is a paged, dynamically balanced metric access method thatresponds gracefully to the insertion of new objects. To date, no algorithm hasbeen published for the corresponding Delete operation. We believe this to benon-trivial because of the design of the M-tree-s Insert algorithm. We proposea modification to Insert that overcomes this problem and give the correspondingDelete algorithm. The performance of the tree is comparable to the M-tree andoffers additional benefits in terms of supported operations, which we brieflydiscuss.

Autor: Alan P. Sexton, Richard Swinbank


Documentos relacionados