Skip to main content
SpringerLink
Log in

An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Accompanying the growth of the Internet, computers throughout the world can connect to each other and exchange information, increasing the convenience and efficiency of information-based work. The advent of data-sharing applications, such as Napster and Gnutella, has made peer-to-peer (P2P) systems popular for widespread exchange of resources and voluminous information between millions of users. In recent years, research issues associated with P2P systems have been discussed widely. To resolve the file-availability problem and improve the workload, a method called the Distributed Hash Table (DHT) has been proposed. However, DHT-based systems in structured architectures cannot support efficient queries, such as a similarity query, range query, and partial-match query, due to the characteristics of the hash function. This study presents a novel scheme that supports filename partial-matches in structured P2P systems. The proposed approach supports complex queries and guarantees result quality. Experimental results demonstrate the effectiveness of the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Bawa M, Manku GS, Raghavan P (2003) SETS: search enhanced by topic-segmentation. In Proceedings of the 26th International ACM Conference on Research and Development in Information Retrieval, Toronto, Canada, pp. 306–313

  2. Beverly Y, Garcia-Molina H (2002) Improving search in peer-to-peer networks. In Proceedings of the 22nd International Conference on Distributed Computing Systems, Vienna, Austria, pp. 5–14

  3. Bhattacharya I, Kashyap SR, Parthasarathy S (2005) Similarity searching in peer-to-peer databases. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, Columbus, Ohio, USA, pp. 329–338

  4. Chrysakis I, Chalkidis C, Plexousakis D (2010) Evaluation of top-k queries in peer-to-peer networks using threshold algorithms. In Proceedings of the 19th ACM International Conference on Information and Knowledge Management,Toronto, Ontario, Canada, pp. 1305–1308

  5. Chen L, Cui B, Shen HT, Lu W, Zhou X (2009) Efficient information retrieval in mobile peer-to-peer networks. In Proceedings of the 18th ACM Conference on Information and Knowledge Management, Hong Kong, China, pp. 967–976

  6. Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems, Vienna, Austria, pp. 23–32

  7. Deb S, Linga P, Rastogi R, Srinivasan A (2008) Accelerating lookups in P2P systems using peer caching. In Proceedings of the 24th International Conference on Data Engineering, Cancun, Mexico, pp. 1003–1012

  8. Doulkeridis C, Nørvåg K, Vazirgiannis M (2008) Peer-to-peer similarity search over widely distributed document collections. In Proceedings of the ACM workshop on Large-Scale distributed systems for information retrieval, Napa Valley California, USA, pp. 35–42

  9. Ganesan P, Sun Q, Garcia-Molina H (2003) YAPPERS: a peer-to-peer lookup service over arbitrary topology. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, Hong Kong, pp. 1250–1260

  10. Guclu H, Yuksel M (2007) Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks. In Proceedings of the 27th International Conference on Distributed Computing Systems. Toronto, Canada, pp. 32

  11. Hung CH, Chung TK (2003) Similarity discovery in structured P2P overlays. In Proceedings of the 32nd International Conference on Parallel Processing, Kaohsiung, Taiwan, pp. 636–644

  12. Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364–397

    Article  Google Scholar 

  13. Lee G, Huang JS, Chen YC (2010) Supporting filename partial matches in structured peer-to-peer overlay. In Proceedings of the 5th International Conference on Grid and Pervasive Computing, Hualien, Taiwan, pp. 101–108

  14. Li R, Song W, Shen H, Xiao W, Lu Z (2011) A flabellate overlay network for multi-attribute search. J Parallel Distr Comput 71(3):407–423

    Article  Google Scholar 

  15. Li H, Tan Q, Lee WC (2006) Efficient progressive processing of skyline queries in peer-to-peer systems. In Proceedings of the 1st International Conference on Scalable Information Systems, Hong Kong, pp. 149–158

  16. Mass Y, Sagiv Y, Shmueli-Scheuer M (2009) A scalable and effective full-text search in P2P networks. In Proceedings of the 18th ACM Conference on Information and Knowledge Managemen, Hong Kong, China, pp. 1979–1982

  17. Mass Y, Sagiv Y, Shmueli-Scheuer M (2011) KMV-peer: a robust and adaptive peer-selection algorithm, In proceedings of the 4th ACM International Conference on Web Search and Data Mining,, Hong Kong, China, pp. 157–166

  18. Nguyen LT, Yee WG, Frieder O (2008) Adaptive distributed indexing for structured peer-to-peer networks. In Proceedings of the 17th ACM Conference on Information and Knowledge Management, Napa Valley, California, USA, pp. 1241–1250

  19. Novak D, Zezula P (2006) M-Chord: a scalable distributed similarity search structure. In Proceedings of the 1st International Conference on Scalable Information Systems, Hong Kong, pp. 1–10

  20. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, USA, pp. 161–172

  21. Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, USA, pp. 149–160

  22. Tang C, Xu Z, Mahalingam M (2003) pSearch: information retrieval in structured overlays. In ACM SIGCOMM Computer Communication Review, Vol. 33, Issue 1, New Jersey, USA, pp 89–94

  23. Tang C, Xu Z, Dwarkadas S (2003) Peer-to-peer information retrieval using self-organizing semantic overlay networks. In Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany, pp. 175–186

  24. Tang Y, Xu J, Zhou S, Lee WC (2009) m-LIGHT: indexing multi-dimensional data over DHTs. In Proceedings of the 29th International Conference on Distributed Computing Systems, Montreal, pp.191-198

  25. Tang Y, Xu J, Zhou S, Lee WC (2011) A lightweight multidimensional index for complex queries over DHTs. IEEE Trans Parallel Distr Syst 22(12):2046–2054

    Article  Google Scholar 

  26. Tang Y, Zhou S, Xu J (2010) Light: a query-efficient yet low-maintenance indexing scheme over Dhts. IEEE Trans Knowl Data Eng 22(1):59–75

    Article  Google Scholar 

  27. Witschel HF (2008) Ranking information resources in peer-to-peer text retrieval: an experimental study. In Proceedings of the ACM Workshop on Large-Scale Distributed Systems for Information Retrieval, Napa Valley, California, USA, pp. 75–82

  28. Wu S, Li J, Ooi BC, Tan KL (2008) Just-in-time query retrieval over partially indexed data on structured P2P overlays. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Vancouver, BC, Canada, pp. 279–290

  29. Wang S, Ooi BC, Tung AKH, Xu L (2007) Efficient skyline query processing on peer-to-peer networks. In Proceedings of the 23rd IEEE International Conference on Data Engineering, Istanbul, Turkey, pp. 1126–1135

  30. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz J (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Area Comm 22(1):41–53

    Article  Google Scholar 

  31. Zhao DJ, Lee DL, Luo Q (2006) DPTree: a distributed pattern tree index for partial-match queries in peer-to-peer networks. In Proceedings of the 10th International Conference on Extending Database Technology, Munich, Germany, pp. 515–532

  32. Available at: http://www.w3.org/PICS/DSig/SHA1_1_0.html

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan, Republic of China

    Guanling Lee, Sheng-Lung Peng, Yi-Chun Chen & Jia-Sin Huang

Authors
  1. Guanling Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheng-Lung Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi-Chun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jia-Sin Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanling Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, G., Peng, SL., Chen, YC. et al. An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay. Peer-to-Peer Netw. Appl. 5, 340–349 (2012). https://doi.org/10.1007/s12083-012-0139-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-012-0139-5

Keywords

Search

Navigation