Sciweavers

1080 search results - page 24 / 216
» Distributed Hash Tables
Sort
View
IPTPS
2003
Springer
15 years 7 months ago
Sloppy Hashing and Self-Organizing Clusters
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating wi...
Michael J. Freedman, David Mazières
SBBD
2008
256views Database» more  SBBD 2008»
15 years 3 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
135
Voted
TPDS
1998
122views more  TPDS 1998»
15 years 2 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
124
Voted
WWW
2008
ACM
16 years 3 months ago
Xml data dissemination using automata on top of structured overlay networks
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
Iris Miliaraki, Zoi Kaoudi, Manolis Koubarakis
SIGCOMM
2006
ACM
15 years 8 months ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...