research-article

Processing complex similarity queries in peer-to-peer networks

Authors:

Claudio Gennaro,

Matteo Mordacchini,

Salvatore Orlando,

Fausto RabittiAuthors Info & Claims

SAC '08: Proceedings of the 2008 ACM symposium on Applied computing

Pages 473 - 478

https://doi.org/10.1145/1363686.1363803

Published: 16 March 2008 Publication History

Get Access

Abstract

Similarity search for content-based retrieval (where content can be any combination of text, image, audio/video, etc.) has gained importance in recent years, also because of the advantage of ranking the retrieved results according to their proximity to a query. However, to use similarity search in real world applications, we need to tackle the problem of huge volumes of such mixed multimedia data (e.g., coming from Web sites) and the problem of their distribution on multiple cooperating nodes. The proposed approach is being used in two running projects: SAPIR and NeP4B.

In this paper we approach this problem by considering a scenario of a network of autonomous peers maintaining a local collection of metric objects (i.e., mixed mode multimedia content). This network forms a distributed Peer-to-Peer (P2P) search engine for similarity search based on the paradigm of Routing Index. Each peer in the network thus maintains both an index of its local resources and a table for every neighbor, summarizing the objects that are reachable from it. The paper presents techniques that aim to make our P2P similarity-based search system viable, trading approximate results for scalable solutions. Results of simulations that use real collections of images are discussed.

References

[1]

2006. Gnutella protocol development. http://rfc-gnutella.sourceforge.net/.

Google Scholar

[2]

M. Batko, D. Novak, F. Falchi, and P. Zezula. On scalability of the similarity search in the world of peers. In InfoScale '06 Proceedings of the 1st international conference on Scalable information systems, page 20, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

[3]

E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Comput. Surv., 33(3):273--321, 2001.

Digital Library

Google Scholar

[4]

A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In Proc. of the 28 tn Conference on Distributed Computing Systems, July 2002.

Digital Library

Google Scholar

[5]

M. Marzolla. libcppsim: a simula-like, portable process-oriented simulation library in C++. In G. Horton, editor, Proc. of ESM04, the 18th European Simulation Multiconference, Magdeburg, DE, 2004. SCS-European Publishing House.

Google Scholar

[6]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM 2001, 2001.

Digital Library

Google Scholar

[7]

I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, F. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw., 11(1):17--32, February 2003.

Digital Library

Google Scholar

[8]

M. Swain and D. Ballard. Color indexing. International Journal of Computer Vision (IJCV), 7(1):11--32, 1991.

Digital Library

Google Scholar

[9]

P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity Search: The Metric Space Approach, volume 32 of Advances in Database Systems. Springer, 2006. 220 p.

Digital Library

Google Scholar

Cited By

View all

Li JZhang GRui YNahrstedt KXu XYao HJiang SCheng J(2010)The state of the art in content-based image retrieval in P2P networksProceedings of the Second International Conference on Internet Multimedia Computing and Service10.1145/1937728.1937762(143-146)Online publication date: 30-Dec-2010
https://dl.acm.org/doi/10.1145/1937728.1937762
Doulkeridis CNørvåg KVazirgiannis MMichel SSkobeltsyn GYee W(2008)Peer-to-peer similarity search over widely distributed document collectionsProceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval10.1145/1458469.1458477(35-42)Online publication date: 30-Oct-2008
https://dl.acm.org/doi/10.1145/1458469.1458477
Barton SDohnal VSedmidubsky JZezula PMichel SSkobeltsyn GYee W(2008)Building self-organized image retrieval networkProceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval10.1145/1458469.1458474(51-58)Online publication date: 30-Oct-2008
https://dl.acm.org/doi/10.1145/1458469.1458474

Index Terms

Processing complex similarity queries in peer-to-peer networks

Recommendations

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Trustworthiness of acquaintances in Peer-to-Peer overlay networks

Various types of applications manipulate objects distributed in Peer-to-Peer overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance ...
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops

Systems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...

Comments

Information & Contributors

Information

Published In

SAC '08: Proceedings of the 2008 ACM symposium on Applied computing

March 2008

2586 pages

ISBN:9781595937537

DOI:10.1145/1363686

Conference Chairs:
Roger L. Wainwright
University of Tulsa
,
Hisham M. Haddad
Kennesaw State University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SAC '08

Sponsor:

SIGAPP

SAC '08: The 2008 ACM Symposium on Applied Computing

March 16 - 20, 2008

Fortaleza, Ceara, Brazil

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
195
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li JZhang GRui YNahrstedt KXu XYao HJiang SCheng J(2010)The state of the art in content-based image retrieval in P2P networksProceedings of the Second International Conference on Internet Multimedia Computing and Service10.1145/1937728.1937762(143-146)Online publication date: 30-Dec-2010
https://dl.acm.org/doi/10.1145/1937728.1937762
Doulkeridis CNørvåg KVazirgiannis MMichel SSkobeltsyn GYee W(2008)Peer-to-peer similarity search over widely distributed document collectionsProceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval10.1145/1458469.1458477(35-42)Online publication date: 30-Oct-2008
https://dl.acm.org/doi/10.1145/1458469.1458477
Barton SDohnal VSedmidubsky JZezula PMichel SSkobeltsyn GYee W(2008)Building self-organized image retrieval networkProceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval10.1145/1458469.1458474(51-58)Online publication date: 30-Oct-2008
https://dl.acm.org/doi/10.1145/1458469.1458474

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Trustworthiness of acquaintances in Peer-to-Peer overlay networks

Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Trustworthiness of acquaintances in Peer-to-Peer overlay networks

Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations