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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in power-law networks. Physics Review Letters 64(46135) (2001)
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)
Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bollobas, B.: Random Graphs. Academic Press, New York (1985)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2005)
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)
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)
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)
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)
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)
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)
Hethcote, H.: The mathematics of infectious diseases. SIAM Review 42(4), 599–653 (2000)
Hromkovic, J., Klasing, R., Monien, B., Peine, R.: Dissemination of information in interconnection networks (broadcasting and gossiping). Combinatorial Network Theory pp. 125–212 (1996)
Jovanovic, M.: Modeling large-scale peer-to-peer networks and a case study of gnutella. Master’s thesis, University of Cincinnati (2001)
Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2000)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS) (2003)
Li, L., Halpern, J., Haas, Z.: Gossip-based ad hoc routing. In: Proceedings of the Conference on Computer Communications (INFOCOM) (2002)
Limewire.com: Gnutella (2006). http://www.limewire.com/
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)
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)
Molloy, M., Reed, B.: A critical point for random grraphs with a given degree sequence. Random Structures and Algorithms 6, 161–180 (1995)
Newman, M., Strogatz, S., Watts, D.: Random graphs with arbitrary degree distribution and their applications. Physical Review E 64(026118) (2001)
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)
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)
Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: Proceedings of the First International Conference on Peer-to-Peer Computing (P2P) (2001)
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)
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)
SharmanNetworks: Kazaa (2006). http://www.kazaa.com/
Stauffer, D., Aharony, A.: Introduction to Percolation Theory, second edn. Taylor and Francis (1992)
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)
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)
Wilf, H.: GeneratingFunctionology, second edn. Academic Press (1994)
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering (ICDE) (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)