P216 - BTW2013 - Datenbanksysteme für Business, Technologie und Web – Workshopband
Auflistung P216 - BTW2013 - Datenbanksysteme für Business, Technologie und Web – Workshopband nach Erscheinungsdatum
1 - 10 von 31
Treffer pro Seite
Sortieroptionen
- KonferenzbeitragTutorium: Neue Hardwarearchitekturen für das Datenmanagement (DPMH)(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Balkesen, Cagri; Woods, Louis; Teubner, Jens
- KonferenzbeitragExtending an index-benchmarking framework with non-invasive visualization capability(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Broneske, David; Schäler, Martin; Grebhahn, AlexanderFinding a suitable multi-dimensional index structure for a data-intensive system is not a trivial task. The QuEval framework supports users in finding the best index structure from a list of candidates. Nevertheless, if an index structure shows itself superior to other index structures most oft the times, but fails for one data set, we want to know the reason for this phenomenon. To support an understanding of deficits, a visualization of the partitioning scheme is helpful. Consequently, we propose a visualization component which interacts with QuEval without affecting the performance evaluation. Thus, we use a modern software-engineering approach based on AspectJ to support Digital Engineering of complex solutions.
- KonferenzbeitragProposal of a privacy-enhancing fingerprint capture for a decentralized police database system from a legal perspective using the example of Germany and the EU(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Pocs, Matthias; Hildebrandt, Mario; Kiltz, Stefan; Dittmann, JanaInnovations in biometric and forensic technology promise new use cases for the fight against crime and threats to public security. For example, the police will be able to use a new scanner to capture fingerprint traces from luggage at the airport to detect dangerous manipulations and identify known criminals. Despite these potentially great benefits, such systems also entail risks for society. One aspect of such systems is the biometric and forensic database used to compare fingerprints captured with a wanted list. This paper explores a possible decentralized database system as a solution to risks entailed by central systems. It uses the German and EU law as an example to justify technology design decisions on the basis of the legal requirements.
- KonferenzbeitragParallel execution of kNN-queries on in-memory K-D trees(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Hering, TimParallel algorithms for main memory databases become an increasingly interesting topic as the amount of main memory and the number of CPU cores in computer systems increase. This paper suggests a method for parallelizing the k-d tree and its kNN search algorithm as well as suggesting optimizations. In empirical tests, the resulting modified k-d tree outperforms both the k-d tree and a parallelized sequential search for medium dimensionality data (6-13 dimensions).
- KonferenzbeitragHyDash: A dashboard for real-time business intelligence based on the hyPer Main memory database system(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Steinkamp, Maren; Mühlbauer, TobiasBusiness Intelligence (BI) is a set of techniques that help improve business decision making. From a technical point of view, BI relies on a set of tools which includes performance dashboards: layered services that combine monitoring, analysis, and reporting. However, most dashboard solutions today are based on data warehouses which face a problem of data staleness-a circumstance caused by the separation of transactional and analytical processing. Novel hybrid main memory database systems such as SAP's HANA or HyPer overcome this issue and achieve best-of-breed transaction processing throughput and analytical query response times in one system in parallel on the same database state. In this work, we contribute HyDash, a web-based dashboard for real-time business intelligence. HyDash visualizes key performance indicators (KPIs) based on predefined SQL queries and provides an ad-hoc SQL query interface to dynamically extend the scope of the dashboard. HyDash relies on (i) hybrid main memory database systems and (ii) a push-based query result update mechanism based on the novel HTML5 WebSockets.
- KonferenzbeitragWorkshop on databases in biometrics, forensics and security applications(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Dittmann, Jana; Fischer, Arno; Saake, Gunter; Vielhauer, Claus
- KonferenzbeitragEnhancing named entity extraction by effectively incorporating the crowd(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Braunschweig, Katrin; Thiele, Maik; Eberius, Julian; Lehner, WolfgangNamed entity extraction is an established research area in the field of information extraction. When tailored to a specific domain and with sufficient pre-labeled training data, state-of-the-art extraction algorithms have achieved near human performance. However, when presented with semi-structured data, informal text or unknown domains where training data is not available, extraction results can deteriorate significantly. Recent research has focused on crowdsourcing as an alternative to automatic named entity extraction or as a tool to generate the required training data. While humans easily adapt to semi-structured data and informal style, a crowd-based approach also introduces new issues due to monetary costs or spamming. We address these issues by combining automatic named entity extraction algorithms with crowdsourcing into a hybrid approach. We have conducted a wide range of experiments on real world data to identify a set of subtasks or operators, that can be performed either by the crowd or automatically. Results show that a meaningful combination of these operators into complex processing pipelines can significantly enhance the quality of named entity extraction in challenging scenarios, while at the same time reducing the monetary costs of crowdsourcing and the risk of misuse.
- KonferenzbeitragOptimierung der Exact-Match Anfrage eines Lokal Sensitiven Hashverfahrens(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Heckel, SarahHochdimensionale Indexverfahren sind wichtig um einen schnellen Zugriff auf Multimediadaten zu gewährleisten. Eine Klasse dieser Verfahren ist das Lokal Sensitive Hashen (LSH). Beim LSH können sehr unterschiedlich ausgelastet Bereiche entstehen. Um die Exakt-Match-Anfrage beim Permutationsansatz, einer Variante des LSHs, effizient bearbeiten zu können, ist eine gleichmäßige Raumaufteilung von Vorteil. Dazu ist die Wahl der Protoypen von großer Bedeutung. Im Folgenden wird ein mathematisches Optimierungsproblem aufgestellt, welches die Prototypen bestimmt. Die Idee dabei ist Kugeln mit minimalem gleichem Radius um die Prototypen zu legen, sodass jeder Datenpunkt in mindestens einer Kugel enthalten ist. Werden optimierte Prototypen für die permutationsbasierte Variante des LSHs gewählt, so ist die Abweichung der Raumaufteilung gegenüber der Aufteilung bei zufällig gewählten Prototypen stabiler.
- KonferenzbeitragCDIM - call for papers(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Nürnberger, Andreas; Balke, Wolf-TiloThe first CDIM workshop on crowd-enabled data and information management was held in conjunction with 15th GI-Fachtagung Datenbanksysteme für Business, Technologie und Web (BTW), Magdeburg, Germany, 2013.
- KonferenzbeitragStream join processing on heterogeneous processors(Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband, 2013) Karnagel, Tomas; Schlegel, Benjamin; Habich, Dirk; Lehner, WolfgangThe window-based stream join is an important operator in all data streaming systems. It has often high resource requirements so that many efficient sequential as well as parallel versions of it were proposed in the literature. The parallel stream join operators recently gain increasing interest because hardware is getting more and more parallel. Most of these operators, however, are only optimized for processors with homogeneous execution units (e.g., multi-core processors). Newly available processors with heterogeneous execution units cannot be exploited whereas such processors provide typically a very high peak performance. In this paper, we propose an initial variant of a window-based stream join operator that is optimized for processors with heterogeneous execution units. We provide an efficient load balancing approach to utilize all available execution units of a processor and further provide highly-optimized kernels that run on them. On our test machine with a 4-core CPU and an integrated graphics processor, our operator achieves a speedup of 69 2x compared to our single-threaded . implementation.