Mobile Peer-to-Peer Systems
Georgia Koloniari · 2005
Peer-to-peer systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. Since the shared data are unstructured and they do not follow a global schema, XML-based descriptions of the data can be used to provide a uniform way to query the heterogeneous data. In our research, we are interested in designing a fully decentralized approach for the problem of efficiently routing path queries among the nodes of a peer-to-peer system. Our approach is based on (a) selecting and maintaining specialized data structures, called filters that efficiently summarize the content, i.e., the documents, of one or more node and (b) using these filters to build an overlay network that groups together nodes with similar content. Our proposed filters for XML documents, called multi-level Bloom filters [1], are based on extending Bloom filters so that they maintain information about the structure of the documents that they summarize. The filters can summarize a large number of documents with a small space overhead while maintaining a low false positive probability. Furthermore, multi-level Bloom filters are used for building