Adaptive Approximate Similarity Searching through Metric Social Networks

Authors:
Jan Sedmidubsky;Stanislav Barton;Vlastislav Dohnal;Pavel Zezula
Affiliations:
Masaryk University, Brno, Czech Republic. xsedmid@fi.muni.cz;Masaryk University, Brno, Czech Republic. xbarton@fi.muni.cz;Masaryk University, Brno, Czech Republic. dohnal@fi.muni.cz;Masaryk University, Brno, Czech Republic. zezula@fi.muni.cz
Venue:
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Year:
2008

Citing 0
Cited 5

Information Retrieval and Filtering over Self-organising Digital Libraries

ECDL '08 Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries
A measure for cluster cohesion in semantic overlay networks

Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Real-life performance of metric searching

SIGSPATIAL Special
The GOSSPLE anonymous social network

Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware

Quantified Score

Hi-index	0.00

Visualization

Abstract

Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between peers, giving similar results, are established on per-query basis. Based on the universal law of generalization, a new query forwarding algorithm is proposed. The same principle is used to manage query histories of individual peers with the possibility to tune the tradeoff between the extent of the history and the level of the query-answer approximation. All algorithms are tested on real data and real network of computers.