Show simple item record

Authordc.contributor.authorMarín, Mauricio 
Authordc.contributor.authorGil Costa, Verónica es_CL
Authordc.contributor.authorHernández, Cecilia es_CL
Admission datedc.date.accessioned2014-01-10T18:48:31Z
Available datedc.date.available2014-01-10T18:48:31Z
Publication datedc.date.issued2009
Cita de ítemdc.identifier.citationSecond International Workshop on Similarity Search and Applications, p. 124 - 131en_US
Identifierdc.identifier.isbn978-0-7695-3765-8
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/120329
Abstractdc.description.abstractWe propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed information about the indexed data in each peer, the average amount of computation and communication performed to solve range queries can be significantly reduced as compared to alternative state of the art strategies based on local indexing at peer level. We illustrate our technique by using an indexing method based on compact clustering.en_US
Lenguagedc.language.isoenen_US
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Keywordsdc.subjectPeer to peer networksen_US
Títulodc.titleDynamic P2P Indexing and Search based on Compact Clusteringen_US
Document typedc.typeCapítulo de libro


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile