Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, and Daniel Zinn   View Paper (PDF)   Return to Poster Papers Abstract Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special problem in this context we consider the evaluation of top-N queries on structured data. Due to the characteristics of large-scaled P2P systems it is nearly impossible to guarantee complete and exact query answers without exhaustive search, which usually ends in flooding the network. In this paper, we address this problem by presenting an approach relying on histogram-based routing filters. These allow for reducing the number of queried peers as well as for giving probabilistic guarantees concerning the goodness of the answer. ©2006 Association for Computing Machinery