Symmetric M-tree

Details Symmetric M-tree Symmetric M-tree

2010-04-23

arxiv.org/abs/1004.4216v1

Computer Science

Databases

8 pages, 10 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Symmetric M-tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetric M-tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric M-tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386620