Skip to main content

Supporting Filename Partial Matches in Structured Peer-to-Peer Overlay

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6104))

Included in the following conference series:

Abstract

In recent years, research issues associated with peer-to-peer (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 chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bawa, M., Manku, G.S., Raghavan, P.: SETS: Search Enhanced by Topic-Segmentation. In: SIGIR, Toronto, Canada, pp. 306–313 (2003)

    Google Scholar 

  2. Guclu, H., Yuksel, M.: Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks. In: ICDCS, Toronto, Canada, p. 32 (2007)

    Google Scholar 

  3. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: ACM SIGCOMM, San Diego, USA, pp. 161–172 (2001)

    Google Scholar 

  4. http://www.w3.org/PICS/DSig/SHA1_1_0.html

  5. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, San Diego, USA, pp. 149–160 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, G., Huang, JS., Chen, YC. (2010). Supporting Filename Partial Matches in Structured Peer-to-Peer Overlay. In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13067-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13066-3

  • Online ISBN: 978-3-642-13067-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics