DOI: 10.1109/BigData66926.2025.11401782 Whereas the literature describes an increasing number of graph algorithms, loading graphs remains a time-consuming component of the end-to-end execution time. Graph frameworks often rely on custom graph storage formats, that are not optimized for efficient loading of large-scale graph datasets. Furthermore, graph loading is often not optimized […]
Monthly archives: November 2025
3 posts
We attended the NI-HPC conference held on 4 November 2025 at Riddel Hall, Queen’s University, Belfast. Hans Vandierendonck presented and talked about the Kelvin Living Lab and aspects of sustainable computing, and Giuliana Cabrera, a summer intern from Massachusetts Institute of Technology, USA, presented the initial studies on URJA. The […]
OrbitSI is an open-source Python framework designed to efficiently solve the subgraph isomorphism enumeration problem, i.e., identifying all subgraphs within a data graph that are structurally identical to a given pattern graph. The tool introduces an orbit-aware pruning and ordering strategy that significantly improves enumeration speed compared to classical algorithms. […]