Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
Development of the domain name system
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Principles of distributed database systems
Principles of distributed database systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-peer research at Stanford
ACM SIGMOD Record
| Hi-index | 0.00 |
Lookup services are used in many Internet applicationsto translate a key (e.g., a file name) into an associated set ofentries (e.g., the location of file copies). The key lookupscan often be satisfied by returning just a few entries insteadof the entire set. However, current implementations oflookup services do not take advantage of this usage pattern.In this paper, we formalize the notion of a partial lookup servicethat explicitly supports returning a subset of the entriesper lookup. We present four schemes for building a partiallookup service, and propose various metrics for evaluatingthe schemes. We show that a partial lookup service mayhave significant advantages over conventional ones in termsof space usage, fairness, fault tolerance, and other factors.