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

Mashayekhi, H ; Sharif University of Technology

358 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s12083-013-0199-1
  3. Abstract:
  4. 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. © 2013 Springer Science+Business Media New York
  5. Keywords:
  6. Classification ; Data management ; Layered overlay ; P2P network ; Query processing
  7. Source: Peer-to-Peer Networking and Applications ; Vol. 7, issue. 2 , 2014 , Pages 199-212 ; ISSN: 19366442
  8. URL: http://link.springer.com/article/10.1007%2Fs12083-013-0199-1