Sciweavers

41 search results - page 8 / 9
» A Super-Peer Based Lookup in Structured Peer-to-Peer Systems
Sort
View
NBIS
2007
Springer
14 years 12 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
COMCOM
2006
110views more  COMCOM 2006»
13 years 6 months ago
MULTI+: A robust and topology-aware peer-to-peer multicast service
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack
SIGMOD
2008
ACM
100views Database» more  SIGMOD 2008»
13 years 6 months ago
Incorporating string transformations in record matching
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
Arvind Arasu, Surajit Chaudhuri, Kris Ganjam, Ragh...
ERLANG
2003
ACM
13 years 11 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
TKDE
2008
137views more  TKDE 2008»
13 years 6 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai