Publication

Semantic Overlay Networks

Publications associées (113)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

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 unstructured P2P systems so far. As unstructured P2P syste ...

2005

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

2005

Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

Karl Aberer, Fabius Klemm

There has been an increasing research interest in developing full-text retrieval based on peer-to-peer (P2P) technology. So far, these research efforts have largely concentrated on efficiently distributing an index. However, ranking of the results retrieve ...

2005

Building trust-aware P2P systems

Zoran Despotovic

This thesis is concerned with enabling e-commerce applications in decentralized environments, P2P networks in particular. The work goes along the following two dimensions: P2P reputation systems design and building P2P e-commerce services and applications. ...

EPFL2005

On SmallWorld Graphs in Non-uniformly Distributed Key Spaces

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world model [6] we extend the model of building “routing-efficient” small-world graph ...

2005

Efficient, self-contained handling of identity in Peer-to-Peer systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique an ...

2004

On de Bruijn Routing in Distributed Hash Tables: There and Back Again

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as well as simplicity of the understanding and implementation of such networks, are unsuitable where key distribution will be uneven, ...

2004

Towards a Foundation Model for Peer-to-Peer Web Information

Karl Aberer, Jie Wu

We find that there lacks a formal algebraic framework in the research area of P2P information retrieval. Such a formal framework is indispensable and pivotal. On the one hand, no solid theoretical foundation can explain why the results of many ad-hoc comme ...

2004

Using SiteRank for P2P Web Retrieval

Karl Aberer, Jie Wu

Studies of the Web graph at the granularity of documents have revealed many interesting link distributions. Similarly, studies of the Web graph at the granularity of Web sites, the so-called hostgraph, revealed relationships among hosts based on linkage an ...

2004

Lazy Parameter Passing

Patrick Eugster

Peer-to-peer (P2P) systems are strongly decentralized and asynchronous distributed settings involving a potentially large number of hosts. A common programing model for P2P infrastructures is that of a distributed hashtable (DHT), though which peers share ...

2003