| Available via | http://dbpubs.stanford.edu/pub/2002-15 |
|
Submitted on |
25th of February 2002 |
|
Author |
Sun, Qixiang; Garcia-Molina, Hector |
|
Title |
Partial Lookup Services (Extended Version) |
|
Date of publication |
February 2002 |
|
Citation |
Sun, Qixiang; Garcia-Molina, Hector. Partial Lookup Services (Extended Version), Technical Report. Stanford University, 2002 |
|
Number of pages |
29 |
|
Language |
English |
|
Project |
Miscellaneous |
|
Type |
Technical Report |
|
Subject group |
Miscellaneous |
|
Abstract |
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. |
| Fulltext source |
Postscript (ps, ps.gz, ps.zip)
PDF (pdf, pdf.gz, pdf.zip)
| Management of the document by | siroker@db.stanford.edu
| |