XM-Tree, a new index for web information retrieval
- Autores
- Deco, Claudia; Pierángeli, Guillermo; Bender, Cristina; Reyes, Nora Susana
- Año de publicación
- 2008
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- 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 L2 as indexing distance and L∞ as similarity criterion to solve queries. We also present experiments validating the results.
Facultad de Informática - Materia
-
Ciencias Informáticas
similarity searching
Metrics - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/3.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/9627
Ver los metadatos del registro completo
| id |
SEDICI_710024df89b31d3dbf29adbe1f3f7387 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/9627 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
XM-Tree, a new index for web information retrievalDeco, ClaudiaPierángeli, GuillermoBender, CristinaReyes, Nora SusanaCiencias Informáticassimilarity searchingMetricsWeb 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.Facultad de Informática2008-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf78-84http://sedici.unlp.edu.ar/handle/10915/9627enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jul08-4.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:43:21Zoai:sedici.unlp.edu.ar:10915/9627Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:43:21.721SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
XM-Tree, a new index for web information retrieval |
| title |
XM-Tree, a new index for web information retrieval |
| spellingShingle |
XM-Tree, a new index for web information retrieval Deco, Claudia Ciencias Informáticas similarity searching Metrics |
| title_short |
XM-Tree, a new index for web information retrieval |
| title_full |
XM-Tree, a new index for web information retrieval |
| title_fullStr |
XM-Tree, a new index for web information retrieval |
| title_full_unstemmed |
XM-Tree, a new index for web information retrieval |
| title_sort |
XM-Tree, a new index for web information retrieval |
| dc.creator.none.fl_str_mv |
Deco, Claudia Pierángeli, Guillermo Bender, Cristina Reyes, Nora Susana |
| author |
Deco, Claudia |
| author_facet |
Deco, Claudia Pierángeli, Guillermo Bender, Cristina Reyes, Nora Susana |
| author_role |
author |
| author2 |
Pierángeli, Guillermo Bender, Cristina Reyes, Nora Susana |
| author2_role |
author author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas similarity searching Metrics |
| topic |
Ciencias Informáticas similarity searching Metrics |
| dc.description.none.fl_txt_mv |
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. Facultad de Informática |
| description |
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. |
| publishDate |
2008 |
| dc.date.none.fl_str_mv |
2008-07 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/9627 |
| url |
http://sedici.unlp.edu.ar/handle/10915/9627 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jul08-4.pdf info:eu-repo/semantics/altIdentifier/issn/1666-6038 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| dc.format.none.fl_str_mv |
application/pdf 78-84 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846063847965720576 |
| score |
13.22299 |