Christian Wiesner · EDBT 2026 Demo

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval

4 papers

Query processing and optimization · 49% Distributed and cloud data management · 48% Indexing and storage engines · 3%

Topics — the 9 heaviest of 9, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Distributed and cloud data management distributed query processing	0.1	2	2004	Dynamic Extensible Query Processing in Super-Peer Based P2P Systems · ICDE 2004 Hyperqueries: Dynamic Distributed Query Processing on the Internet · VLDB 2001
Distributed and cloud data management › peer-to-peer data management peer-to-peer databases	0.0	1	2004	Dynamic Extensible Query Processing in Super-Peer Based P2P Systems · ICDE 2004
Query processing and optimization › analytical query processing decision support query processing	0.0	1	2000	Exploiting early sorting and early partitioning for decisionsupport query processing · VLDB J. 2000
Query processing and optimization aggregation	0.0	1	1999	Generalised Hash Teams for Join and Group-by · VLDB 1999
Query processing and optimization › aggregate query processing group-by query	0.0	1	1999	Generalised Hash Teams for Join and Group-by · VLDB 1999
Query processing and optimization › join processing › join algorithms hash join	0.0	1	1999	Generalised Hash Teams for Join and Group-by · VLDB 1999
Query processing and optimization join processing	0.0	1	1999	Generalised Hash Teams for Join and Group-by · VLDB 1999
Indexing and storage engines partitioning	0.0	1	2000	Exploiting early sorting and early partitioning for decisionsupport query processing · VLDB J. 2000
Query processing and optimization sorting	0.0	1	2000	Exploiting early sorting and early partitioning for decisionsupport query processing · VLDB J. 2000

Methods — techniques the papers use, named apart from their topics

hashing · 0.0

Year	Publication	Venue	Position
2005	Building Scalable Electronic Market Places Using HyperQuery-Based Distributed Query Processing Alfons Kemper, Christian Wiesner	World Wide Web	2
2004	Dynamic Extensible Query Processing in Super-Peer Based P2P Systems abstract To enable dynamic, extensible, and distributed query processing in super-peer based P2P networks, where standard query operators and user-defined code can be executed nearby the data, we distribute query processing to (super-) peers. Therefore, super-peers provide functionality for the management of the indices, query optimization, and query processing. Additionally, we expect that peers provide query processing capabilities to be full members of the P2P network. To enable this, super-peers have to provide an optimizer for generating efficient query plans from the queries they receive. The distribution process is guided by the routing index which is dynamic and corresponds to the data allocation schema in traditional distributed DBMSs. Christian Wiesner, Alfons Kemper, Stefan Brandl	ICDE	1
2002	Building Dynamic Market Places Using HyperQueries Christian Wiesner, Peter Winklhofer, Alfons Kemper	EDBT	1
2001	Hyperqueries: Dynamic Distributed Query Processing on the Internet Alfons Kemper, Christian Wiesner	VLDB	2
2000	Exploiting early sorting and early partitioning for decisionsupport query processing Jens Claußen, Alfons Kemper, Donald Kossmann, Christian Wiesner	VLDB J.	4
1999	Generalised Hash Teams for Join and Group-by Alfons Kemper, Donald Kossmann, Christian Wiesner	VLDB	3