Clock-G: A temporal graph management system with space-efficient storage technique

Abstract

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs

“…In [33], a query relaxation algorithm was proposed that solves the small or even empty result sets when performing query operations in temporal graph databases. However, the efcient managing of the time information is key for our solution, which has not been studied in previous algorithms [18,20,30,33,42,43]. Moreover, these studies have not considered the case of a GST with a specifed tree root.…”

Clock-G: Temporal Graph Management System

“…Note that due to space limitations, this section presents some formulas without detailed explanations of their derivation. A more comprehensive complexity analysis is present in our previous paper [30].…”

“…This paper is an extension of our previous work [30]. A major improvement of this version compared to our previous work is the inclusion of a query language that supports complex temporal queries into Clock-G, including graph pattern matching and navigational queries with temporal predicates.…”