Work

Temporal graph processing in modern memory hierarchies

Year: 2024

Type: article

Abstract: Updates in graph DBMS lead to structural changes in the graph over time with different intermediate states. Capturing these changes and their time is one of the main purposes of temporal DBMS. Most DBMSs built their temporal features based on their non-temporal processing and storage without considering the memory hierarchy of the underlying system. This leads to slower temporal processing and poor storage utilization. In this paper, we propose a storage and processing strategy for (bi-) temporal graphs using temporal materialized views (TMV) while exploiting the memory hierarchy of a modern system. Further, we show a solution to the query containment problem for certain types of temporal graph queries. Finally, we evaluate the overhead and performance of the presented approach. The results show that using TMV reduces the runtime of temporal graph queries while using less memory.

Source: Information Systems

DOI: 10.1016/j.is.2024.102462

Authors: Alexander Baumstark, Muhammad Attahir Jibril, Kai-Uwe Sattler

Institution: Technische Universität Ilmenau

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,090

Funder: Deutsche Forschungsgemeinschaft