Routing XQuery in A P 2 P Network Using Adaptable Trie-Indexes

The increasing popularity of XML and P2P networks has generated much interest in distributed processing of XML data. In this paper, we propose a novel solution for schema and content indexing in a P2P architecture. Our solution is based on a hierarchy of super-peers managing progressively compressed summaries of XML schemas. The main features of the extended tries used for schema and XML data indexing are scalability, as the index adapts to the different memory capacities of peers, and efficiency as it is very simple to provide routing decisions based on path-set matching. We summarize the results of experiments that prove the validity of the proposed distributed trie-indexes. This work is partly included in the Satine European Project that develops a P2P semantic mediator for publishing and discovering web services.