<?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%">Carlos Baquero Moreno</style></author><author><style face="normal" font="default" size="100%">Nuno Lopes</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Search Optimizations in Structured Peer-to-Peer Systems</style></title><secondary-title><style face="normal" font="default" size="100%">18th International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises - WET ICE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June </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/10.1.1.159.8669.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Groningen, Netherlands</style></pub-location><pages><style face="normal" font="default" size="100%">111–115</style></pages><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 P2P resources as a scalable platform for very large data storage applications. However, their efficiency expects a level of uniformity in the association of data to index keys that is often not present in inverted indexes. Index data tends to follow non-uniform distributions, often power law distributions, creating intense local storage hotspots and network bottlenecks on specific hosts. Current techniques like caching cannot, alone, cope with this issue. We propose a distributed data structure based on a decentralized balanced tree to balance storage data and network load more uniformly across hosts. The results show that the data structure is capable of balancing resources, in particular when performing.&lt;/p&gt;
</style></abstract></record></records></xml>