Extending peer-to-peer networks for approximate search

Authors:
Alain Mowat;Roman Schmidt;Michael Schumacher;Ion Constantinescu
Affiliations:
Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland;University of Applied Sciences, Western Switzerland, Sierre, Switzerland;Digital Optim
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 3
Cited 0

Flexible Information Discovery in Decentralized Distributed Systems

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Similarity Queries on Structured Data in Structured Overlays

ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Hyperspaces for object clustering and approximate matching in peer-to-peer overlays

HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems

Quantified Score

Hi-index	0.00

Visualization

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.