A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index.
Sang-Hyuk LimKyong-I KuKi-Chang KimYoo-Sung KimPublished in: ICDE Workshops (2006)
Keyphrases
- dynamic programming
- significant improvement
- high accuracy
- computational complexity
- learning algorithm
- index structure
- computational cost
- tree structure
- search space
- cost function
- np hard
- experimental evaluation
- detection algorithm
- distance function
- similarity index
- hash table
- clustering method
- worst case
- optimal solution
- objective function
- multi dimensional
- segmentation algorithm
- optimization algorithm
- probabilistic model
- k means
- data structure
- times faster
- suffix tree
- optimal path
- database