Progressive Distributed Top k Retrieval in Peer-to-Peer Networks

Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objects' degree of match for each different query predicate and returning the best matching objects only. In peer-to-peer systems such strategies are even more important, given the potentially large number of peers, which may contribute to the results. Yet current peer-to-peer research has barely started to investigate such approaches. In this paper we will discuss the benefits of best match/top-k queries in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP topology we will show how to use local indexes for optimizing the necessary query r...

• Type: Conference
• Year: 2005
• Where: ICDE
• Authors: Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uwe Thaden
• Keywords: Database, ICDE 2005, Limited Query Processing, Necessary Data Traffic, Necessary Query