Skip to main content
SpringerLink
Log in

Case Study: Scoop for Partial Read from P2P Database

  • Chapter
  • First Online:
Handbook of Peer-to-Peer Networking

  • 2554 Accesses

Abstract

In this paper we propose Scoop, a mechanism to implement the “partial read operation” for peer-to-peer databases. A peer-to-peer database is a database that its relations are horizontally fragmented and distributed among the nodes of a peer-to-peer network. The partial read operation is a data retrieval operation required for approximate query processing in peer-to-peer databases. A partial read operation answers to β -queries: given β ∈ [0,1]and a relation R, a fraction β of the tuples in R must be retrieved from the database to answer a β -query. Despite the simplicity of the β -query, due to the distributed, evolving and autonomous nature of the peer-to-peer databases correct and efficient implementation of the partial read operation is challenging. Scoop is designed based on an epidemic dissemination algorithm. We model the epidemic dissemination as a percolation problem and by rigorous percolation analysis tune Scoop per-query and on-the-fly to answer β -queries correctly and efficiently. We prove the correctness of Scoop by theoretical analysis, and verify the efficiency of Scoop in terms of query cost and query time via extensive simulation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 449.99
Price excludes VAT (USA)
  • Durable hardcover 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. Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in power-law networks. Physics Review Letters 64(46135) (2001)

    Google Scholar 

  2. Banaei-Kashani, F., Shahabi, C.: Partial selection query in peer-to-peer databases (poster paper). In: Proceedings of the 22nd International Conference on Data Engineering (ICDE) (2006)

    Google Scholar 

  3. Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  4. Bollobas, B.: Random Graphs. Academic Press, New York (1985)

    MATH  Google Scholar 

  5. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2005)

    Google Scholar 

  6. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS) (2002)

    Google Scholar 

  7. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing (PODC) (1987)

    Google Scholar 

  8. Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., Wicker, S.B.: An empirical study of epidemic algorithms in large scale multihop wireless networks. Tech. Rep. CSD-TR 02-0013, UCLA (2002)

    Google Scholar 

  9. Ganesh, A., Massoulié, L., Towsley, D.: The effect of network topology on the spread of epidemics. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2005)

    Google Scholar 

  10. Gkantsidis, C., Mihail, M., Saberi, A.: Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2005)

    Google Scholar 

  11. Gummadi, K., Dunn, R., Saroiu, S., Gribble, S., Levy, H., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the Symposium on Operating Systems Principles (SOSP) (2003)

    Google Scholar 

  12. Hethcote, H.: The mathematics of infectious diseases. SIAM Review 42(4), 599–653 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of information in interconnection networks (broadcasting and gossiping). Combinatorial Network Theory pp. 125–212 (1996)

    Google Scholar 

  14. Jovanovic, M.: Modeling large-scale peer-to-peer networks and a case study of gnutella. Master’s thesis, University of Cincinnati (2001)

    Google Scholar 

  15. Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2000)

    Google Scholar 

  16. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2003)

    Google Scholar 

  17. Li, L., Halpern, J., Haas, Z.: Gossip-based ad hoc routing. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2002)

    Google Scholar 

  18. Limewire.com: Gnutella (2006). http://www.limewire.com/

  19. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International Conference on supercomputing (ICS) (2002)

    Google Scholar 

  20. Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make gnutella scalable? In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS) (2002)

    Google Scholar 

  21. Molloy, M., Reed, B.: A critical point for random grraphs with a given degree sequence. Random Structures and Algorithms 6, 161–180 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  22. Newman, M., Strogatz, S., Watts, D.: Random graphs with arbitrary degree distribution and their applications. Physical Review E 64(026118) (2001)

    Google Scholar 

  23. Ozsoyoglu, G., Du, K., Guruswamy, S., Hou, W.: Processing real-time, non-aggregate queries with time-constraintsin case-db. In: Proceedings of the 8th International Conference on Data Engineering (ICDE) (1992)

    Google Scholar 

  24. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) (2001)

    Google Scholar 

  25. Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: Proceedings of the First International Conference on Peer-to-Peer Computing (P2P) (2001)

    Google Scholar 

  26. Saroiu, S., Gummadi, P., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking (MMCN) (2002)

    Google Scholar 

  27. Sarshar, N., Boykin, P.O., Roychowdhury, V.: Percolation search in power law networks: Making unstructured peer-to-peer networks scalable. In: Fourth International Conference on Peer-to-Peer Computing (P2P) (2004)

    Google Scholar 

  28. SharmanNetworks: Kazaa (2006). http://www.kazaa.com/

  29. Stauffer, D., Aharony, A.: Introduction to Percolation Theory, second edn. Taylor and Francis (1992)

    Google Scholar 

  30. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) (2001)

    Google Scholar 

  31. Vrbsky, S., Liu, J.: Approximate - a query processor that produces monotonically improving approximate answers. IEEE Transactions on Knowledge and Data Engineering (TKDE) 5(6), 1056–1068 (1993)

    Article  Google Scholar 

  32. Wilf, H.: GeneratingFunctionology, second edn. Academic Press (1994)

    Google Scholar 

  33. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering (ICDE) (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Southern California, 90089-0781, Los Angeles, CA, USA

    Farnoush Banaei-Kashani & Cyrus Shahabi

Authors
  1. Farnoush Banaei-Kashani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyrus Shahabi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Farnoush Banaei-Kashani .

Editor information

Editors and Affiliations

  1. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Xuemin Shen

  2. Huawei Technologies, Somerset Corporate Blvd. 400, Bridgewater, 08807, U.S.A.

    Heather Yu

  3. Avaya Labs Research, Mount Airy Road 233, Basking Ridge, 07920, U.S.A.

    John Buford

  4. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Mursalin Akon

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Banaei-Kashani, F., Shahabi, C. (2010). Case Study: Scoop for Partial Read from P2P Database. In: Shen, X., Yu, H., Buford, J., Akon, M. (eds) Handbook of Peer-to-Peer Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09751-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09751-0_21

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09750-3

  • Online ISBN: 978-0-387-09751-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation