Autor:	Sexton, Alan P., Swinbank, Richard
Rok vydání:	2010
Předmět:	Computer Science - Databases Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresponding Delete operation. We believe this to be non-trivial because of the design of the M-tree's Insert algorithm. We propose a modification to Insert that overcomes this problem and give the corresponding Delete algorithm. The performance of the tree is comparable to the M-tree and offers additional benefits in terms of supported operations, which we briefly discuss. Comment: 8 pages, 10 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1004.4216 Zobrazit plný text záznamu View this record from Arxiv