XM-Tree, a new index for web information retrieval
Web Information Retrieval is another problem of searching elements of a set that are closest to a given query under a certain similarity criterion. It is of interest to take advantage of metric spaces in order to solve a search in an effective and efficient way. In this article, we present an extens...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2008
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9627 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jul08-4.pdf |
| Aporte de: |
| Sumario: | Web Information Retrieval is another problem of searching elements of a set that are closest to a given query under a certain similarity criterion. It is of interest to take advantage of metric spaces in order to solve a search in an effective and efficient way. In this article, we present an extension of the M-Tree index, called XM-Tree, in order to improve search results. This index allows dynamic insertion of new data, reduces search costs using pruning and precalculated distances, and uses a tolerable amount of space, which makes this index apt for the extensive and dynamic Web. The proposed extension indexes Web documents, uses L<sub>2</sub> as indexing distance and L<sub>∞</sub> as similarity criterion to solve queries. We also present experiments validating the results. |
|---|