A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://siret.ms.mff.cuni.cz/skopal/pub/reinsertions.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
On reinsertions in M-tree
<span title="">2008</span>
<i title="IEEE">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2008 IEEE 24th International Conference on Data Engineering Workshop</a>
</i>
Preserved Fulltext
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from the leaf (reducing the covering radius), and then again inserted into the M-tree in a usual way. A regular leaf split is performed only after a series of unsuccessful reinsertion attempts. We expect the forced reinsertions will result in more compact Mtree hierarchies (i.e., more efficient query processing), while the
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdew.2008.4498352">doi:10.1109/icdew.2008.4498352</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/LokocS08.html">dblp:conf/icde/LokocS08</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3wjnzthyyjfolkzweponn6nkm4">fatcat:3wjnzthyyjfolkzweponn6nkm4</a>
</span>
more »
... index construction costs should be kept as low as possible. Considering both low construction costs and low querying costs, we examine several combinations of construction policies with reinsertions. The experiments show that forced reinsertions could significantly decrease the number of distance computations, thus speeding up indexing as well as querying. First International Workshop on Similarity Search and Applications 0-7695-3101-6/08 $25.00
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810202804/http://siret.ms.mff.cuni.cz/skopal/pub/reinsertions.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/7f/597fd1ea6f241b462a10a6d8ccf98fcd3b2460d2.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icdew.2008.4498352">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>