On Sat, 2003-06-07 at 21:26, Benja Fallenstein wrote:
Hermanni Hyytiälä wrote:
On Fri, 2003-06-06 at 14:06, Tuomas Lukka wrote:
- A hostile (or faulty) peer(s) stores lot of dummy key-value-pairs with
a certain key
Does GISP allow several values per key?
Like DSHT ? No.
No, like a normal DHT, so that a lookup returns all values associated
with a key. Yes, it does; we use it all the time.
Sorry, I don't understand your answer completely :).
I understood Tuomas' question like "Does GISP support frequent fetches
and frequent *stores* of the same hash table key" (like DSHT supports),
not like "Only one value can be stored under a key at any given time in
regular DHTs. Thus, frequent retrievals but only one *store* is
supported. Does GISP support this ?"