Rainer Gemulla

Rainer Gemulla

Auto-generated profile, based on publicly available information

Rainer Gemulla

University of Mannheim, Mannheim, Germany

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
21 August 2011
Verified
Conference Paper
Open access
PDF file
RGRainer Gemulla
Rainer Gemulla
ENErik Nijkamp
Erik Nijkamp
PHPeter J. Haas
Peter J. Haas
YSYannis Sismanis
Yannis Sismanis

13 May 2013
Verified
Conference Paper
Open access
PDF file
LCLuciano Del Corro
Luciano Del Corro
RGRainer Gemulla
Rainer Gemulla

1 June 2011 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
MEMohamed Y. Eltabakh
Mohamed Y. Eltabakh
YTYuanyuan Tian
Yuanyuan Tian
FÖFatma Özcan
Fatma Özcan
RGRainer Gemulla
Rainer Gemulla
AKAljoscha Krettek
Aljoscha Krettek
JMJohn McPherson
John McPherson
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate related data on the same set of nodes. To overcome this bottleneck, we introduce CoHadoop, a lightweight extension of Hadoop that allows applications to control where data are stored. In contrast to previous approaches, CoHadoop retains the flexibility of Hadoop in that it does not require users to convert their data to a certain format (e.g., a relational database or a specific file format). Instead, applications give hints to CoHadoop that some set of files are related and may be processed jointly; CoHadoop then tries to colocate these files for improved efficiency. Our approach is designed such that the strong fault tolerance properties of Hadoop are retained. Colocation can be used to improve the efficiency of many operations, including indexing, grouping, aggregation, columnar storage, joins, and sessionization. We conducted a detailed study of joins and sessionization in the context of log processing---a common use case for Hadoop---, and propose efficient map-only algorithms that exploit colocated data partitions. In our experiments, we observed that CoHadoop outperforms both plain Hadoop and previous work. In particular, our approach not only performs better than repartition-based algorithms, but also outperforms map-only algorithms that do exploit data partitioning but not colocation. 8.

18 September 2018
Verified
Book Chapter
Closed access
PDF file
CMChristian Meilicke
Christian Meilicke
MFManuel Fink
Manuel Fink
YWYanjie Wang
Yanjie Wang
DRDaniel Ruffinelli
Daniel Ruffinelli
RGRainer Gemulla
Rainer Gemulla
HSHeiner Stuckenschmidt
Heiner Stuckenschmidt

11 June 2007
Verified
Conference Paper
Open access
PDF file
KBKevin Beyer
Kevin Beyer
PHPeter J. Haas
Peter J. Haas
BRBerthold Reinwald
Berthold Reinwald
YSYannis Sismanis
Yannis Sismanis
RGRainer Gemulla
Rainer Gemulla

1 January 2017
Verified
Conference Paper
Open access
KGKiril Gashteovski
Kiril Gashteovski
RGRainer Gemulla
Rainer Gemulla
LCLuciano Del Corro
Luciano Del Corro