Skip to main content
SpringerLink
Log in

L-overlay: A layered data management scheme for peer-to-peer computing

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

Abstract

Efficient storage and handling of data stored in a peer-to-peer (P2P) network, proves vital for various applications such as query processing and data mining. This paper presents a distributed, scalable and robust layered overlay (L-overlay) to index and manage multidimensional data in a dynamic P2P network. The proposed method distinguishes between the data and peer layers, with efficient mapping between the two. The data is organized such that semantically similar data objects are accessed hastily. Grid and tree structures are proposed for the peer layer. As application examples of L-overlay in query processing and data mining, k-nearest neighbors query processing and distributed Naïve Bayes classification algorithms, are proposed. We show the effectiveness of our scheme in static and dynamic environments using simulation. L-overlay is shown to be more efficient than SSW, an available semantic overly, in terms of maintenance and query processing costs.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Abbasi U, Mushtaq M, Ahmed T (2009) Delivering scalable video coding using P2P small-world based push-pull mechanism. In: Proc. of the Second international conference on Global Information Infrastructure Symposium (GIIS’09). IEEE Press, Piscataway, pp 94–100

    Google Scholar 

  2. Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries, SIGCOMM. ACM press, New York, pp 353–366. doi:10.1145/1015467.1015507

    Google Scholar 

  3. Cannataro M, Talia D (2003) The knowledge grid. Commun ACM 46(1):89–93

    Article  Google Scholar 

  4. Cheng X, Xu J, Pe Ji, Liu J (2010) Hierarchical distributed data classification in wireless sensor networks. Comput Commun 33(12):1404–1413

    Article  Google Scholar 

  5. Datta S, Bhaduri K, Giannella C, Wolff R, Kargupta H (2006) Distributed data mining in peer-to-peer networks. IEEE Internet Comput Spec Issue Distrib Data Min 10(4):18–26

    Article  Google Scholar 

  6. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. ACM SIGMOD. ACM Press, pp 47–57. doi:10.1145/971697.602266

  7. Hui KYK, Lui JCS, Yau DKY (2006) Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds. Comput Netw 50(15):2727–2746

    Article  MATH  Google Scholar 

  8. Jagadish HV, Ooi BC, Vu QH, Zhang R, Zhou A (2006) VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proc. of 22nd International Conference on Data Engineering. IEEE press, pp 34–34. doi:10.1109/ICDE.2006.169

  9. Jagadish HV, Ooi BC, Tan K-L, Vu QH, Zhang R (2006) Speeding up search in peer-to-peer networks with a multi-way tree structure. SIGMOD, ACM, New York, pp 1–12. doi:10.1145/1142473.1142475

    Google Scholar 

  10. Kowalczyk W, Jelasity M (2003) Towards data mining in large and fully distributed peer-to-peer overlay networks. In: Proc. 15th Belgian-Dutch Conf. Artificial Intelligence (BNAIC 03), Nijmegen, Netherlands, pp 203–210

  11. Langley P, Iba W, Thompson K (1992) An analysis of bayesian classifiers. In: Proc. of 10th national conference on artificial intelligence. AAAI Press, pp 223–228

  12. Lee J, Lee H, Kang S, Kim SM, Song J (2004) CISS: an efficient object clustering framework for DHT-based peer-to-peer applications. In: Proc. of international workshop on databases, information systems and peer-to-peer computing, pp 215–229

  13. Li M, Lee WC, Sivasubramaniam A (2006) DPTree: a balanced tree based indexing framework for peer-to-peer systems. In: Proc. of international conference on network protocols. IEEE press, pp 12–21. doi:10.1109/ICNP.2006.320194

  14. Li M, Lee WC, Sivasubramaniam A, Zhao J (2008) SSW: a small-world-based overlay for peer-to-peer search. IEEE Trans Parallel Distrb Syst 19(6):735–749

    Article  Google Scholar 

  15. Mondal A, Lifu Y, Kitsuregawa M (2005) P2pr-tree: an r-tree-based spatial index for peer-to-peer environments. In: Proc. of current trends in database technology-EDBT workshops. Springer, Berlin, pp 516–516

    Google Scholar 

  16. Ratnasamy S, Francis P, Handley M, Karp RM, Schenker S (2001) A scalable content-addressable network. In: Proc. of SIGCOMM. ACM press, pp 161–172. doi:10.1145/383059.383072

  17. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbour queries. In: Proc. of ACM SIGMOD international conference on management of data. ACM Press, pp 71–79. doi:10.1145/223784.223794

  18. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location and routing for largescale peer to peer systems. In: Guerraoui R (ed) Middleware 2001 IFIP/ACM international conference on distributed systems platforms. Springer, Heidelberg, pp 329–350

    Google Scholar 

  19. Sahin OD, Antony S, Agrawal D, Abbadi AE (2005) PRoBe: multi-dimensional range queries in P2P networks. In: Ngu AH, Kitsuregawa M, Neuhold EJ, Chung JY, Sheng QZ (eds) Proc. of the 6th international conference on web information systems engineering. Springer-Verlag, Berlin, pp 332–346. doi:10.1007/11581062_25

    Google Scholar 

  20. Seidl T, Kriegel HP (1998) Optimal multi-step k-nearest neighbour search. In: Proc. of ACM SIGMOD international conference on management of data. ACM Press, pp 154–165. doi:10.1145/276304.276319

  21. Song Z, Roussopoulos N (2001) K-nearest neighbour search for moving query point. In: Proc. of 7th international symposium on advances in spatial and temporal databases. Springer-Verlag Press, pp 79–96. doi:10.1.1.108.8564

  22. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Commun Rev 31(4):149–160

    Article  Google Scholar 

  23. Sun X (2007) SCAN: a small-world structured P2P overlay for multi-dimensional queries. In: Proceedings of the WWW, pp 1191–1192

  24. Tang C, Xu Z, Dwarkadas S (2003) Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. of ACM SIGCOMM, ACM press, pp 175–186. doi:10.1145/863955.863976

  25. 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 

  26. Wang J, Wu S, Gao H, Li J, Ooi BC (2010) Indexing multi-dimensional data in a cloud system. In: ACM international conference on the management of data (SIGMOD). ACM, New York, pp 591–602. doi:10.1145/1807167.1807232

    Google Scholar 

  27. Wolff R, Bhaduri K, Kargupta H (2009) A generic local algorithm for mining data streams in large distributed systems. IEEE Trans Knowl Data Eng 21(4):465–478

    Article  Google Scholar 

  28. Yu X, Pu K, Koudas N (2005) Monitoring k-nearest neighbour queries over moving objects. In: Proc. of 21st international conference on data engineering. IEEE Press, pp 631–642. doi:10.1109/ICDE.2005.92

  29. Zhang C, Xiao W, Tang D, Tang J (2011) P2P-based multidimensional indexing methods: a survey. J Syst Softw 84(12):2348–2362. doi:10.1016/j.jss.2011.07.027

    Article  Google Scholar 

  30. Zhang M, Mao G (2011) An approach for distributed streams mining using combination of Naïve Bayes and decision trees. In: Proc. of DBKDA, St. Maarten, Netherlands Antilles, pp 29–33

  31. Zhuge H, Chen X, Sun XP, Yao E (2008) HRing: a structured P2P overlay based on harmonic series. IEEE Trans Parallel Distrib Syst 19(2):145–158

    Article  Google Scholar 

  32. Zuo HY, Ning J, Deng YD, Luo C (2008) CAN-QTree: a distributed spatial index for peer-to-peer networks. In: Proc. of the 10th IEEE international conference on high performance computing and communications. IEEE press, pp 250–257

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Sharif University of Technology, Tehran, Iran

    Hoda Mashayekhi & Jafar Habibi

Authors
  1. Hoda Mashayekhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jafar Habibi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoda Mashayekhi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mashayekhi, H., Habibi, J. L-overlay: A layered data management scheme for peer-to-peer computing. Peer-to-Peer Netw. Appl. 7, 199–212 (2014). https://doi.org/10.1007/s12083-013-0199-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-013-0199-1

Keywords

Search

Navigation