A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index

@article{Lim2006ANS,
  title={A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index},
  author={Sang-Hyuk Lim and Kyong-I Ku and Ki-Chang Kim and Yoo-Sung Kim},
  journal={22nd International Conference on Data Engineering Workshops (ICDEW'06)},
  year={2006},
  pages={15-15}
}
Even though the ideal split policy for M-tree should determine which two routing objects are promoted so that the two partitioned regions would have minimum volume and minimum overlapped space, the previously proposed split algorithms must fail to achieve the goal since they select the actual entries from overflow entries as the routing objects to be… CONTINUE READING