A B S T R A C T
In this paper, we study the well-known algorithm of Bentley and Saxe in the context of
similarity search in metric spaces. We apply the algorithm to existing static metric index
structures, obtaining dynamic ones. We show that the overhead of the Bentley–Saxe
method is quite low, and because it facilitates the dynamic use of any state-of-the-art
static index method, we can achieve results comparable to, or even surpassing, existing
dynamic methods. Another important contribution of our approach is that it is very
simple—an important practical consideration. Rather than dealing with the complexities
of dynamic tree structures, for example, the core index can be built statically, with full
knowledge of its data set.
& 2013 Elsevier Ltd. All rights reserved.
[aio_button align=”none” animation=”none” color=”red” size=”small” icon=”none” text=”انجام مقاله علمی پژوهشی و ISI در این زمینه” target=”_blank” relationship=”dofollow” url=”http://payannameha.ir/?p=796″]
[aio_button align=”none” animation=”none” color=”orange” size=”small” icon=”none” text=”دریافت سایر مقالات در این زمینه” target=”_blank” relationship=”dofollow” url=”http://payannameha.ir/?page_id=297″]
[aio_button align=”none” animation=”none” color=”blue” size=”small” icon=”none” text=”انجام پایان نامه در این حوزه” relationship=”dofollow” url=”http://payannameha.ir/?page_id=3206″]
[aio_button align=”none” animation=”none” color=”pink” size=”small” icon=”none” text=”انجام پروپوزال در این حوزه” target=”_blank” relationship=”dofollow” url=”http://payannameha.ir/?page_id=3206″]
[aio_button align=”none” animation=”none” color=”green” size=”small” icon=”none” text=”ترجمه تخصصی این مقاله” target=”_blank” relationship=”dofollow” url=”http://payannameha.ir/?p=154″]
جهت خرید فایل به انتهای صفحه مراجعه نمایید
کد محصول : شماره 81
[aio_button align=”none” animation=”none” color=”green” size=”small” icon=”none” text=”پرداخت کارت به کارت” target=”_blank” relationship=”dofollow” url=”http://jozvekade.ir/?page_id=1139″]