Dynamic P2P Indexing and Search Based on Compact Clustering

Authors:
Mauricio Marin;Veronica Gil-Costa;Cecilia Hernandez
Affiliations:
-;-;-
Venue:
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Year:
2009

Citing 0
Cited 3

Approximate distributed metric-space search

Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Load Balancing Query Processing in Metric-Space Similarity Search

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Modelling efficient novelty-based search result diversification in metric spaces

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a strategy to perform query processing on P2P similarity search systems based on peers and super-peers. 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.