Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Uwe Wloka

dblp:32/186 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Databases, data management, data science and information retrieval · 5Artificial intelligence and machine learning · 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
1 paper
Data integration and cleaning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data integration system
0.112008
DIPBench Toolsuite: A Framework for Benchmarking Integration Systems · ICDE 2008
Data integration and cleaning
integration benchmarking
0.112008
DIPBench Toolsuite: A Framework for Benchmarking Integration Systems · ICDE 2008
Performance modeling and evaluation
benchmarking
0.012008
DIPBench Toolsuite: A Framework for Benchmarking Integration Systems · ICDE 2008

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

federated DBMS · 0.2benchmark specification · 0.2
YearPublicationVenuePosition
2011 Cost-based vectorization of instance-based integration processes
Matthias Boehm 0001, Dirk Habich, Steffen Preissler, Wolfgang Lehner, Uwe Wloka
Inf. Syst.5
2009 Cost-Based Vectorization of Instance-Based Integration Processes
Matthias Boehm 0001, Dirk Habich, Steffen Preissler, Wolfgang Lehner, Uwe Wloka
ADBIS5
2009 GCIP: exploiting the generation and optimization of integration processes
abstract
As a result of the changing scope of data management towards the management of highly distributed systems and applications, integration processes have gained in importance. Such integration processes represent an abstraction of workflow-based integration tasks. In practice, integration processes are pervasive and the performance of complete IT infrastructures strongly depends on the performance of the central integration platform that executes the specified integration processes. In this area, the three major problems are: (1) significant development efforts, (2) low portability, and (3) inefficient execution. To overcome those problems, we follow a model-driven generation approach for integration processes. In this demo proposal, we want to introduce the so-called GCIP Framework (Generation of Complex Integration Processes) which allows the modeling of integration process and the generation of different concrete integration tasks. The model-driven approach opens opportunities for rule-based and workload-based optimization techniques.
Matthias Boehm 0001, Uwe Wloka, Dirk Habich, Wolfgang Lehner
EDBT2
2008 Workload-based optimization of integration processes
abstract
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These integration processes are an abstraction for workflow-based integration tasks, used in EAI servers and WfMS. The major problem are significant workload changes during runtime. The performance of integration processes strongly depends on those dynamic workload characteristics, and hence workload-based optimization is important. However, existing approaches of workflow optimization only address the rule-based optimization and disregard changing workload characteristics. To overcome the problem of inefficient process execution in the presence of workload shifts, here, we present an approach for the workload-based optimization of instance-based integration processes and show that significant execution time reductions are possible.
Matthias Boehm 0001, Uwe Wloka, Dirk Habich, Wolfgang Lehner
CIKM2
2008 DIPBench Toolsuite: A Framework for Benchmarking Integration Systems
abstract
So far the optimization of integration processes between heterogeneous data sources is still an open challenge. A first step towards sufficient techniques was the specification of a universal benchmark for integration systems. This DIPBench allows to compare solutions under controlled conditions and would help generate interest in this research area. However, we see the requirement for providing a sophisticated toolsuite in order to minimize the effort for benchmark execution. This demo illustrates the use of the DIPBench toolsuite. We show the macro-architecture as well as the micro-architecture of each tool. Furthermore, we also present the first reference benchmark implementation using a federated DBMS. Thereby, we discuss the impact of the defined benchmark scale factors. Finally, we want to give guidance on how to benchmark other integration systems and how to extend the toolsuite with new distribution functions or other functionalities.
Matthias Boehm 0001, Dirk Habich, Wolfgang Lehner, Uwe Wloka
ICDE4