Woong-Kee Loh*
CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1251-1267, 2021, DOI:10.32604/cmc.2020.012763
- 26 November 2020
Abstract Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize More >
Login
Register
