Partial Lookup Service

Lookup services are used in many Internet applications to translate a key (e.g., a file name) into an associated set of entries (e.g., the location of file copies). The key lookups can often be satisfied by returning just a few entries instead of the entire set. However, current implementations of lookup services do not take advantage of this usage pattern. In this paper, we formalize the notion of a partial lookup service that explicitly supports returning a subset of the entries per lookup. We present four schemes for building a partial lookup service, and propose various metrics for evaluating the schemes. We show that a partial lookup service may have significant advantages over conventional ones in terms of space usage, fairness, fault tolerance, and other factors.

• Type: Conference
• Year: 2003
• Where: ICDCS
• Authors: Qixiang Sun, Hector Garcia-Molina
• Keywords: Distributed And Parallel Computing, ICDCS 2003, Key Lookups, Lookup Service, Partial Lookup Service