research-article

Extending peer-to-peer networks for approximate search

Authors:

Alain Mowat,

Roman Schmidt,

Michael Schumacher,

Ion ConstantinescuAuthors Info & Claims

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

Pages 455 - 459

https://doi.org/10.1145/1363686.1363800

Published: 16 March 2008 Publication History

Get Access

Abstract

This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains neighborhood relationships so that two similar inputs will result in two similar outputs. The error correcting code is then used to group the similar encoded values around special codewords. In this manner, similar content is located as close as possible in the network. The algorithm is tested in a simulated environment on a HyperCube network overlay.

References

[1]

M. Aharia, A. Chandel, S. Saroiu, and S. Keshav. Finding content in file-sharing networks when you cant even spell. In Proceedings of the 6th international Workshop on Peer-to-Peer Systems (IPTPS07), 2007.

Google Scholar

[2]

R. Ahmed and R. Boutaba. A scalable peer-to-peer protocol enabling efficient and flexible search, 2006.

Google Scholar

[3]

R. Ahmed and R. Boutaba. Distributed pattern matching for p2p systems. In Proceedings of the 10th IEEE/IFIP Network Operations and Management Symposium (NOMS06), April 2007.

Google Scholar

[4]

Marcel Karnstedt and Kai-Uwe Sattler and Manfred Hauswirth and Roman Schmidt. Similarity Queries on Structured Data in Structured Overlays. In 2nd IEEE International Workshop on Networking Meets Databases (NetDB'06), Atlanta, GA, USA, April 2006.

Digital Library

Google Scholar

[5]

C. Schmidt and M. Parashar. Flexible information discovery in decentralized distributed systems. In Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, 2003.

Digital Library

Google Scholar

[6]

C. Schmidt and M. Parashar. Analyzing the search characteristics of space filling curve-based indexing within the squid p2p data discovery system, 2004.

Google Scholar

[7]

B. Wong, Y. Vigfusson, and E. Sirer. Hyperspaces for object clustering and approximate matching in peer-to-peer overlays. In Proceedings of the Workshop on Hot Topics in Operating Systems, 2007.

Digital Library

Google Scholar

Cited By

View all

Ben-Gal IShavitt YWeinsberg EWeinsberg U(2014)Peer-to-peer information retrieval using shared-content clusteringKnowledge and Information Systems10.1007/s10115-013-0619-939:2(383-408)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s10115-013-0619-9
Kshemkalyani A(2010)Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2010.2421:9(1281-1289)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1109/TPDS.2010.24

Index Terms

Extending peer-to-peer networks for approximate search

Recommendations

Assisted Peer-to-Peer Search with Partial Indexing

In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P application till today is file sharing, e.g., Gnutella, Kazza, etc. These ...
Ranking factors in peer-to-peer overlay networks

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. ...
On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce ...

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

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

2
Total Citations
View Citations
118
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

Ben-Gal IShavitt YWeinsberg EWeinsberg U(2014)Peer-to-peer information retrieval using shared-content clusteringKnowledge and Information Systems10.1007/s10115-013-0619-939:2(383-408)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s10115-013-0619-9
Kshemkalyani A(2010)Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2010.2421:9(1281-1289)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1109/TPDS.2010.24

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

Assisted Peer-to-Peer Search with Partial Indexing

Ranking factors in peer-to-peer overlay networks

On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

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

Assisted Peer-to-Peer Search with Partial Indexing

Ranking factors in peer-to-peer overlay networks

On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

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