Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Efficient Processing of XPath Queries with Structured Overlay Networks

Summary: Efficient Processing of XPath Queries
with Structured Overlay Networks
Gleb Skobeltsyn, Manfred Hauswirth, and Karl Aberer
Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Switzerland
{gleb.skobeltsyn, manfred.hauswirth, karl.aberer}@epfl.ch
Abstract. Non-trivial search predicates beyond mere equality are at
the current focus of P2P research. Structured queries, as an important
type of non-trivial search, have been studied extensively mainly for un-
structured P2P systems so far. As unstructured P2P systems do not use
indexing, structured queries are very easy to implement since they can
be treated equally to any other type of query. However, this comes at the
expense of very high bandwidth consumption and limitations in terms of
guarantees and expressiveness that can be provided. Structured P2P sys-
tems are an efficient alternative as they typically offer logarithmic search
complexity in the number of peers. Though the use of a distributed index
(typically a distributed hash table) makes the implementation of struc-
tured queries more efficient, it also introduces considerable complexity,
and thus only a few approaches exist so far. In this paper we present a
first solution for efficiently supporting structured queries, more specif-
ically, XPath queries, in structured P2P systems. For the moment we


Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne


Collections: Computer Technologies and Information Sciences