QPM: Phonetic aware P2P search

Efficient discovery of information based on partially specified and misspelled query keywords is a challenging problem in large scale peer-to-peer (P2P) networks. This paper presents QPM, a P2P search mechanism for efficient information retrieval with misspelled and partial keywords. QPM uses the do...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Ninth International Conference on Peer-to-Peer Computing pp. 131 - 134
Main Authors Haque, M.R., Ahmed, R., Boutaba, R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2009
Subjects
Bandwidth
Computer science
Encoding
Hamming distance
Information retrieval
Large-scale systems
Natural languages
Peer to peer computing
Resilience
Routing protocols
Online AccessGet full text

Cover

More Information
Summary:Efficient discovery of information based on partially specified and misspelled query keywords is a challenging problem in large scale peer-to-peer (P2P) networks. This paper presents QPM, a P2P search mechanism for efficient information retrieval with misspelled and partial keywords. QPM uses the double metaphone algorithm to phonetically match misspelled query keywords with advertised keywords. For achieving bandwidth efficiency and similarity matching, QPM incorporates second order Reed-Muller code within the Plexus protocol having a logarithmic routing efficiency on overlay network size. QPM supports large scale networks and achieves better resilience to peer failure by maintaining redundant routing paths and by systematically placing index replicas. The concept presented in this paper is supported by necessary experimental evaluation.
ISBN:1424450667
9781424450664
ISSN:2161-3559
DOI:10.1109/P2P.2009.5284536