Apr 24, 2022 · Databases

Subgraph Matching in Graph Databases: Concepts, Algorithms, and Optimizations

This article introduces graph databases, contrasts them with relational databases, explains the subgraph‑matching problem and its computational complexity, surveys backtracking and multi‑way join algorithms, discusses worst‑case‑optimal joins, set‑intersection acceleration, hardware support, and presents PKUMOD’s gStore research and its distributed extensions.

SPARQLgStoregraph databases

0 likes · 19 min read

Subgraph Matching in Graph Databases: Concepts, Algorithms, and Optimizations

DataFunTalk

Apr 18, 2022 · Databases

Subgraph Matching in Graph Databases: Concepts, Algorithms, and Optimizations

This article introduces graph databases, explains the subgraph‑matching problem, compares it with relational databases, discusses its computational complexity, and surveys backtracking and multi‑way join algorithms, worst‑case optimal joins, set‑intersection SIMD acceleration, and the gStore system’s research contributions.

RDFSIMDSPARQL

0 likes · 19 min read