| dc.contributor.author | Skopal, Tomáš | |
| dc.contributor.author | Pokorný, Jaroslav | |
| dc.contributor.author | Krátký, Michal | |
| dc.contributor.author | Snášel, Václav | |
| dc.date.accessioned | 2006-10-04T11:26:08Z | |
| dc.date.available | 2006-10-04T11:26:08Z | |
| dc.date.issued | 2003 | |
| dc.identifier.citation | Advances in databases and information systems. 2003, p. 148-162. | en |
| dc.identifier.isbn | 3-540-20047-9 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/56820 | |
| dc.description.abstract | The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of building the M-tree. The first one incorporates a multi-way object insertion while the second one exploits the generalized slim-down algorithm. Usage of these techniques or even combination of them significantly increases the querying performance of the M-tree. We also present comparative experimental results on large datasets showing that the new techniques outperform by far even the static bulk loading algorithm. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Advances in Databases and Information Systems | en |
| dc.relation.uri | http://dx.doi.org/10.1007/b12032 | en |
| dc.subject | M-tree | en |
| dc.subject | bulk loading | en |
| dc.subject | multi-way insertion | en |
| dc.subject | slim-down algorithm | en |
| dc.title | Revisiting M-tree building principles | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/b12032 | |
| dc.identifier.wos | 000186344900013 | |