Research in databases, or more broadly in data management, addresses questions related to efficient and effective access to relevant data from a variety of sources. These sources include traditional databases, as well as other data repositories, distributed data, online data, and continuously generated data (streaming data). The group has expertise in accelerating complex query evaluation by developing efficient algorithmic strategies, designing algorithms that leverage the inherent parallelism of modern CPUs and GPUs, and creating exploratory queries that assist users in expressing their queries and retrieving relevant results. We work with diverse data types, including vector data, graph data, multimedia data, and more. We develop general methods applicable across various domains, while some methods specifically target particular properties such as spatio-temporal ordering or molecular characteristics. Our focus is on creating scalable solutions capable of handling large data volumes.
Data continues to grow, exceeding any humanly manageable quantities. We need systems that support access to relevant data. In order to find relevant data without annoying wait times, we need efficient solutions to retrieve data seamlessly as part of software applications or through standalone requests.
Making good use of available computational resources (which might otherwise go unused) is also important from a sustainability perspective. The same applies to avoiding wasteful computations.
Exploratory queries assist non-expert users in finding data, thereby democratizing data access.
Kenneth S. Bøgh, Sean Chester, Ira Assent
Work-Efficient Parallel Skyline Computation for the GPU (Proc. VLDB Endow)
Jakob Rødsgaard Jørgensen, \katrine Scheel, Ira Assent, Ajeet Ram Pathak, Anne C. Elster
GPU-FAST-PROCLUS: A Fast GPU-parallelized Approach to Projected Clustering (EDBT 2022)
Cheng Huang, Alexander Mathiasen, Josef Dean, Davide Mottin, Ira Assent
HUNIPU: Efficient Hungarian Algorithm on IPUs (ICDEW 2024)
Anton Tsitsulin, Marina Munkhoeva, Davide Mottin, Panagiotis Karras, Ivan V. Oseledets, Emmanuel Müller
FREDE: Anytime Graph Embeddings (Porc. VLDN Endow)
Jithin Vachery, Akhil Arora, Sayan Ranu, Arnab Bhattacharya:
RAQ: Relationship-Aware Graph Querying in Large Networks (WWW 2019)