Wolf-Tilo Balke

Prof. Wolf-Tilo Balke

TU Braunschweig
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2004
Verified
Book Chapter
Closed access
PDF file
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke
UGUlrich Güntzer
Ulrich Güntzer
JZJason Xin Zheng
Jason Xin Zheng

19 April 2005
Verified
Conference Paper
Closed access
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke
WNW. Nejdl
W. Nejdl
WSW. Siberski
W. Siberski
UTU. Thaden
U. Thaden
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 routing and how to process intermediate results in inner network nodes at the earliest possible point in time cutting down the necessary data traffic within the network. Our algorithm is based on dynamically collected query statistics only, no continuous index update processes are necessary, allowing it to scale easily to large numbers of peers, as well as dynamic additions/deletions of peers. We will show our approach to always deliver correct result sets and to be optimal in terms of necessary object accesses and data traffic. Finally, we present simulation results for both static and dynamic network environments.

18 March 2013
Verified
Conference Paper
Open access
PDF file
CLChristoph Lofi
Christoph Lofi
KMKinda El Maarry
Kinda El Maarry
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke

13 November 2002
Verified
Conference Paper
Closed access
JGJ. Guntzer
J. Guntzer
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke
WKW. Kiessling
W. Kiessling

11 June 2007
Verified
Conference Paper
Open access
PDF file
XZXuan Zhou
Xuan Zhou
JGJulien Gaugaz
Julien Gaugaz
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke
WNWolfgang Nejdl
Wolfgang Nejdl

10 October 2004
Verified
Conference Paper
Open access
PDF file
KNKlara Nahrstedt
Klara Nahrstedt
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke