Improving XPath Query Execution in P2P XML Storage by Using a Decentralized Index
Key: PKLS07-1
Author: Konstantin Pussep, Predrag Knezevic, Nicolas Liebau, Ralf Steinmetz
Date: September 2007
Kind: In proceedings
Publisher: Springer
Book title: VLDB International Workshop On Databases, Information Systems and Peer-to-Peer Computing (DBISP2P-2007)
Keywords: p2p, index, databases, XML
Abstract: Today, information is managed incresingly in dynamic communities on the Internet. Here, peer-to-peer communities in which users host data by contributing their resources is a very promising alternative for centralized hosting. Managed data is often represented in XML and requires a high-level query language, where XPath is a good candidate. In this paper, we present a decentralized XML index which enables efficient XPath queries on large documents stored in p2p systems. Unlike other approaches, we do not rely on a specific overlay as our solution is able to work on top of any structured overlay which provides common put and get operations. Our approach is combined with P2P XML Storage, which stores arbitrarily large XML files in p2p networks efficiently. Evaluation has proven that our index improves the XPath query performance regarding both the execution time and the number of messages by orders of magnitude.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.