<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Nuno Lopes</style></author><author><style face="normal" font="default" size="100%">Carlos Baquero Moreno</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Taming hot-spots in dht inverted indexes</style></title><secondary-title><style face="normal" font="default" size="100%">The 11th International Workshop on. Large-Scale and Distributed Systems - LSDS-IR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">February</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/cbm/files/acmlsdsir07.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Citeseer</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">7</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;DHT systems are structured overlay networks capable of using&lt;br /&gt;
P2P resources as a scalable platform for very large data storage&lt;br /&gt;
applications. However, their efficiency expects a level of uni-&lt;br /&gt;
formity in the association of data to index keys that is often&lt;br /&gt;
not present in inverted indexes. Index data tends to follow non-&lt;br /&gt;
uniform distributions, often power law distributions, creating in-&lt;br /&gt;
tense local storage hotspots and network bottlenecks on specific&lt;br /&gt;
hosts. Current techniques like caching cannot, alone, cope with&lt;br /&gt;
this issue.&lt;br /&gt;
We propose a new distributed data structure based on a decen-&lt;br /&gt;
tralized balanced tree to balance storage data and network load&lt;br /&gt;
more uniformly across all hosts. The approach is stackable with&lt;br /&gt;
standard DHTs and ensures that the DHT storage subsystem re-&lt;br /&gt;
ceives an uniform load by assigning fixed sized, or low variance,&lt;br /&gt;
blocks.&lt;/p&gt;
</style></abstract></record></records></xml>