Retrieving arbitrary XML fragments from structured peer-to-peer networks

  • Authors:

  • Toshiyuki Amagasa;Chunhui Wu;Hiroyuki Kitagawa

  • Affiliations:

  • Graduate School of Systems and Information Engineering, Department of Computer Science, University of Tsukuba, Tsukuba, Japan and Center for Computational Sciences, University of Tsukuba, Tsukuba, ...;Graduate School of Systems and Information Engineering, Department of Computer Science, University of Tsukuba, Tsukuba, Japan;Graduate School of Systems and Information Engineering, Department of Computer Science, University of Tsukuba, Tsukuba, Japan and Center for Computational Sciences, University of Tsukuba, Tsukuba, ...

  • Venue:
  • APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel method for the storage and retrieval of XML in structured P2P networks. Peer-to-Peer (P2P), a new paradigm in the field of distributed computing, is attracting much attention. In particular,DHT(Distributed HashTable) offers effective and powerful search through peer collaboration. However, query retrieval of arbitrary XML fragments using DHTs is a challenging issue because of the impedancemismatch between hashing, which is the core mechanism of the DHTs, and the complex structure of XML data and theXML query model. To address this problem, we propose a novel scheme for managing XML data in DHT. Specifically, we (virtually) deploy two kinds of DHTs, called Contents-DHT(C-DHT) and Structure-DHT(S-DHT), tomap textual information and structural information, respectively. Queries against stored XML are processed using the DHTs concurrently. We can, therefore, retrieve arbitrary XML fragments. Effectiveness of the proposed scheme is demonstrated with a series of experiments.