Accès ouvert
2025
article
OpenAlex
F. Marleau, Rebecca Habas, D. Carollo, P.‐A. Duc et autres
The Euclid Q1 fields were selected for calibration purposes in cosmology and are therefore relatively devoid of nearby galaxies. However, this is precisely what makes them interesting fields in which to search for dwarf galaxies in local density environments. We took advantage …
at, it, fr, gb, ru, ca, de, es, nl, sk, us, ch, au, pt, no, dk
(code pays fourni par la source)
Accès ouvert
2025
preprint
OpenAlex
F. R. Marleau, Rebecca Habas, D. Carollo, C. Tortora et autres
The Euclid Q1 fields were selected for calibration purposes in cosmology and are therefore relatively devoid of nearby galaxies. However, this is precisely what makes them interesting fields in which to search for dwarf galaxies in local density environments. We take advantage …
2019
conference-paper
OpenAlex
Stefan Sprenger, Patrick Schäfer, Ulf Leser
We present the BB-Tree, a fast and space-efficient index structure for processing multidimensional workloads in main memory. It uses a k-ary search tree for pruning and searching while keeping all data in leaf nodes. It linearizes the inner search tree and manages …
de
(code pays fourni par la source)
Accès ouvert
2019
dissertation
OpenAlex
Stefan Sprenger
Datenbanksysteme verwenden Indexstrukturen, um Suchanfragen zu beschleunigen. Im Laufe der letzten Jahre haben Forscher verschiedene Ansätze zur Indexierung von Datenbanktabellen im Hauptspeicher entworfen. Hauptspeicherindexstrukturen versuchen möglichst häufig Daten zu verwenden, die bereits im Zwischenspeicher der CPU vorrätig sind, anstatt, wie bei traditionellen …
Accès ouvert
2019
dataset
OpenAlex
Stefan Sprenger, Patrick Schäfer, Ulf Leser
de
(code pays fourni par la source)
Accès ouvert
2018
conference-paper
OpenAlex
Stefan Sprenger, Patrick Schäfer, Ulf Leser
Range queries over multidimensional data are an important part of database workloads in many applications. Their execution may be accelerated by using multidimensional index structures (MDIS), such as kd-trees or R-trees. As for most index structures, the usefulness of this approach depends …
de
(code pays fourni par la source)
2018
conference-paper
OpenAlex
Stefan Sprenger, Steffen Zeuch, Ulf Leser
Over the last years, vectorized instructions have been successfully applied to accelerate database algorithms. However, these instructions are typically only available as intrinsics and specialized for a particular hardware architecture or CPU model. As a result, today's database systems require a manual …
de
(code pays fourni par la source)
Accès ouvert
2018
article
OpenAlex
Norbert Latz, Christine Brombach, Gerhard Eichenauer, Johannes Gehling et autres
2017
conference-paper
OpenAlex
Stefan Sprenger, Steffen Zeuch, Ulf Leser
de
(code pays fourni par la source)
2015
conference-paper
OpenAlex
P. Elmer, Artur Lupp, Stefan Sprenger, René Thaler et autres
at
(code pays fourni par la source)