XPath lookup queries in P2P networks

We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the extensions needed to deal with XML data and XPath queries. A single peer can hold a whole document or a partial/complete fragment of the latter. Each XML fragment/document is identified by a distinct path expression, which is encoded in a distributed hash table. Our framework differs from content-based routing mechanisms, biased towards finding the most relevant peers holding the data. We perform fragments placement and enable fragments lookup by solely exploiting few path expressions stored on each peer. By taking advantage of quasi-zero replication of global catalogs, our system supports fast full and partial XPath querying. To this purpose, we have extended the Chord simulator and performed an experimental evaluation of our approach. Categories and Subject Descriptors: H.2.4 [Database Management]: Systems-d...

• Type: Conference
• Year: 2004
• Where: WIDM
• Authors: Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea, Mayank Jain
• Keywords: P2P Networks, Path Expressions, WIDM 2004, XML Data