Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...
The widespread use of RDF-based information necessitates efficient information retrieval techniques in wide-area networks. In this paper, we present Dynamic Semantic Space, a sche...
Abstract. The unprecedented growth and increased importance of geographically distributed spatial data has created a strong need for efficient sharing of such data. Interestingly, ...