https://shio-chan-dev.github.io/jeanblog/tags/graph-database/Recent content in Graph Database on Jeanphilo BlogHugo -- 0.159.2en-usMon, 09 Feb 2026 10:04:05 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/100-graph-partitioning-edge-cut-vertex-cut-metis/Mon, 09 Feb 2026 10:04:05 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/100-graph-partitioning-edge-cut-vertex-cut-metis/A practical graph partitioning guide for production graph databases, covering Edge-cut vs Vertex-cut, the core METIS workflow, runnable examples, and an engineering tuning checklist.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/Mon, 09 Feb 2026 09:59:16 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/A systematic guide to Subgraph Isomorphism (NP-hard) and the core ideas of VF2/Ullmann, with emphasis on engineering reality: constrained pattern queries and candidate pruning usually matter more than the algorithm name itself.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/50-graph-centrality-degree-betweenness-closeness/Mon, 09 Feb 2026 09:56:11 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/50-graph-centrality-degree-betweenness-closeness/A systematic guide to the three core graph centrality metrics: Degree, Betweenness, and Closeness. The key engineering takeaway: most production systems prioritize Degree and approximate Betweenness, with clear complexity and rollout tradeoffs.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/Mon, 09 Feb 2026 09:54:25 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/A systematic explanation of PageRank and Personalized PageRank, from iterative computation and sparse-matrix implementation to incremental update strategies, covering core graph-database scenarios such as recommendation and influence analysis.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/Mon, 09 Feb 2026 09:50:22 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/A systematic guide to undirected Connected Components and directed SCCs, with emphasis on Tarjan (common in production) and Kosaraju, mapped to graph-database scenarios such as community pre-grouping, subgraph splitting, and partition hints.