GraphNews

In February 2026 I will start teaching the third edition of the Knowledge Graphs course at Ghent University. This is an elective course in which I teach everything I know about creating interoperable data ecosystems. As in the previous editions, we open up this elective course as well to professionals using a micro credential. Feel like going back to school? We poured our heart and soul into this one. 🤓 👉 https://lnkd.in/euUiiEwJ Co-teachers include Ruben Verborgh, Ben De Meester, Ruben Taelman and yourself (there’s a peer teaching assignment).

𝗖𝗮𝗻 𝗮 𝗥𝗲𝗹𝗮𝘁𝗶𝗼𝗻𝗮𝗹 𝗗𝗮𝘁𝗮𝗯𝗮𝘀𝗲 𝗕𝗲 𝗮 𝗞𝗻𝗼𝘄𝗹𝗲𝗱𝗴𝗲 𝗚𝗿𝗮𝗽𝗵? Not all knowledge graphs are equal. A semantic KG (RDF/OWL/Stardog) isn’t the same as a property graph (Neo4j), and both differ from enforcing graph-like structures in a relational DB (CockroachDB/Postgres). Each has strengths and trade-offs: 𝗦𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝗞𝗚𝘀 excel at reasoning and inference over ontologies. 𝗣𝗿𝗼𝗽𝗲𝗿𝘁𝘆 𝗴𝗿𝗮𝗽𝗵𝘀 shine when exploring relationships with intuitive query patterns. 𝗥𝗲𝗹𝗮𝘁𝗶𝗼𝗻𝗮𝗹 𝗮𝗽𝗽𝗿𝗼𝗮𝗰𝗵𝗲𝘀 enforce graph-like models via schema, FKs, indexes, recursive CTEs — with added benefits of scale, distributed TXs, and decades of maturity. 𝗚𝗿𝗮𝗽𝗵 𝗧𝗿𝗮𝘃𝗲𝗿𝘀𝗮𝗹𝘀 𝗶𝗻 𝗦𝗤𝗟 Recursive CTEs let SQL “walk the graph.” Start with a base case (movie + actors), then repeatedly join back to discover multi-hop paths (actors → movies → actors → movies). This simulates “friends-of-friends” traversals in a few lines of SQL. 𝗥𝗔𝗚, 𝗚𝗿𝗮𝗽𝗵𝗥𝗔𝗚, 𝗮𝗻𝗱 𝗟𝗟𝗠𝘀 RAG and GraphRAG give LLMs grounding in structured data, reducing hallucinations and injecting context. Whether via RDF triples, LPG edges, or SQL joins — the principle is the same: real relationships fuel better answers. 𝗧𝗵𝗲 𝟯-𝗛𝗼𝗽 𝗔𝗿𝗴𝘂𝗺𝗲𝗻𝘁 Some vendors claim SQL breaks down after 3 hops. In reality, recursive CTEs traverse arbitrary depth. SQL may not be as compact as Cypher or GQL, but it’s expressive and efficient — the “3-hop wall” is outdated FUD. 𝗟𝗼𝗮𝗱𝗶𝗻𝗴 𝗗𝗮𝘁𝗮 𝗮𝘁 𝗦𝗰𝗮𝗹𝗲 One graph DB is notorious for slow, resource-heavy CSV loads. Distributed RDBMS like CockroachDB can bulk ingest 100s of GB to TBs efficiently. 𝗡𝗼 𝗦𝘁𝗮𝗹𝗲 𝗗𝗮𝘁𝗮 Too often, data must move from TX systems into a graph before use — by then, it’s stale. For AI-driven apps, that lag means hallucinations, missed insights, and poor UX. 𝗪𝗵𝘆 𝗧𝗵𝗶𝘀 𝗠𝗮𝘁𝘁𝗲𝗿𝘀 𝗳𝗼𝗿 𝗔𝗜 As AI apps go multi-regional and global, they demand low latency + strong consistency. Centralized graph DBs hit lag, hotspots, scaling pain. Distributed SQL delivers expressive queries and global consistency — exactly what AI workloads need. You don’t need to pick “graph” or “relational” as religion. Choose the right model for scale, consistency, and AI grounding. Sometimes RDF. Sometimes LPG. And sometimes, graph-enforced in SQL. #KnowledgeGraph #ArtificialIntelligence #GenerativeAI #DistributedSQL #CockroachDB | 11 comments on LinkedIn

The data storage layer serves as the foundation of any robust data and AI initiative. Traditionally, the phrase “data store” almost…

Abstracting the UI

Looking into building knowledge graphs? Check out this code tutorial on how we built a knowledge graph of the latest 'La Liga' standings! ⚽️👩‍💻 Google Coll...

Agentic Ontology Assisted Framework for Semantic Triple Extraction - growgraph/ontocast

As organizations increasingly prioritize linked data capabilities to connect information across the enterprise, selecting the right graph framework to leverage has become more important than ever. In this webinar, graph technology experts from Enterprise Knowledge Elliot Risch, James Egan, David Hughes, and Sara Nash shared the best ways to manage and apply a selection of these frameworks to meet enterprise needs.

Tackle the core challenges related to enterprise-ready graph representation and learning. With this hands-on guide, applied data scientists, machine learning engineers, and... - Selection from Scaling Graph Learning for the Enterprise [Book]

Just released a new notebook exploring Semantic Entity Resolution & Extraction using DSPy (Community) and Google's new LangExtract library. Inspired by Russell Jurney’s excellent work on semantic entity resolution, this demo follows his approach of combining: ✅ embeddings, ✅ kNN blocking, ✅ and LLM matching with DSPy (Community). On top of that, I added a general extraction layer to test-drive LangExtract, a Gemini-powered, open-source Python library for reliable structured information extraction. The goal? Detect and merge mentions of the same real-world entities across text. It’s an end-to-end flow tackling one of the most persistent data challenges. Check it out, experiment with your own data, 𝐞𝐧𝐣𝐨𝐲 𝐭𝐡𝐞 𝐬𝐮𝐦𝐦𝐞𝐫 and let me know your thoughts! cc Paco Nathan you might like this 😉 https://wor.ai/8kQ2qa

Sign in or join now to see posts like this one and more.

Stop manually building your company's brain. ❌ Having reviewed the excellent DeepLearning.AI lecture on Agentic Knowledge Graph Construction, by Andreas Kollegger and writing a book on Agentic graph system with Sam Julien, it is clear that the use of agentic systems represents a shift in how we build and maintain knowledge graphs (KGs). Most organizations are sitting on a goldmine of data spread across CSVs, documents, and databases. The dream is to connect it all into a unified Knowledge Graph, an intelligent brain that understands your entire business. The reality? It's a brutal, expensive, and unscalable manual process. But a new approach is changing everything. Here’s the new playbook for building intelligent systems: 🧠 Deploy an AI Agent Workforce Instead of rigid scripts, you use a cognitive assembly line of specialized AI agents. A Proposer agent designs the data model, a Critic refines it, and an Extractor pulls the facts. This modular approach is proven to reduce errors and improve the accuracy and coherence of the final graph. 🎨 Treat AI as a Designer, Not Just a Doer The agents act as data architects. In discovery mode, they analyze unstructured data (like customer reviews) and propose a new logical structure from scratch. In an enterprise with an existing data model, they switch to alignment mode, mapping new information to the established structure. 🏛️ Use a 3-Part Graph Architecture This technique is key to managing data quality and uncertainty. You create three interconnected graphs: The Domain Graph: Your single source of truth, built from trusted, structured data. The Lexical Graph: The raw, original text from your documents, preserving the evidence. The Subject Graph: An AI-generated bridge that connects them. It holds extracted insights that are validated before being linked to your trusted data. Jaro-Winkler is a string comparison algorithm that measures the similarity or edit distance between two strings. It can be used here for entity resolution, the process of identifying and linking entities from the unstructured text (Subject Graph) to the official entities in the structured database (Domain Graph). For example, the algorithm compares a product name extracted from a customer review (e.g., "the gothenburg table") with the official product names in the database. If the Jaro-Winkler similarity score is above a certain threshold, the system automatically creates a CORRESPONDS_TO relationship, effectively linking the customer's comment to the correct product in the supply chain graph. 🤝 Augment Humans, Don't Replace Them The workflow is Propose, then Approve. AI does the heavy lifting, but a human expert makes the final call. This process is made reliable by tools like Pydantic and Outlines, which enforce a rigid contract on the AI's output, ensuring every piece of data is perfectly structured and consistent. And once discovered and validated, a schema can be enforced. | 32 comments on LinkedIn

by J Bittner John Sowa once observed: In logic, the existential quantifier ∃ is a notation for asserting that something exists. But logic itself has no vocabulary for describing the things that exist.

Nodestream is a developer friendly Python framework for materializing and working with graph databases.

Data-hungry AI applications are fed complex information, and that's where graph databases and knowledge graphs play a crucial role.

Sharing our recent research 𝐅𝐢𝐧𝐑𝐞𝐟𝐥𝐞𝐜𝐭𝐊𝐆: 𝐀𝐠𝐞𝐧𝐭𝐢𝐜 𝐂𝐨𝐧𝐬𝐭𝐫𝐮𝐜𝐭𝐢𝐨𝐧 𝐚𝐧𝐝 𝐄𝐯𝐚𝐥𝐮𝐚𝐭𝐢𝐨𝐧 𝐨𝐟 𝐅𝐢𝐧𝐚𝐧𝐜𝐢𝐚𝐥 𝐊𝐧𝐨𝐰𝐥𝐞𝐝𝐠𝐞 𝐆𝐫𝐚𝐩𝐡𝐬. It is the largest financial knowledge graph built from unstructured data. The preprint of our article is out on arXiv now (link is in the comments). It is coauthored with Abhinav Arun | Fabrizio Dimino | Tejas Prakash Agrawal While LLMs make it easier than ever to generate knowledge graphs, the real challenge lies in ensuring quality without hallucinations, with strong coverage, precision, comprehensiveness, and relevance. FinReflectKG tackles this through an iterative, evaluation-driven agentic approach, carefully optimized across multiple evaluation metrics to deliver a trustworthy and high-quality knowledge graph. Designed to power use cases like entity search, question answering, signal generation, predictive modeling, and financial network analysis, FinReflectKG sets a new benchmark for building reliable financial KGs and showcases the potential of agentic workflows in LLM-driven systems. We will be creating a suite of benchmarks using FinReflectKG for KG related tasks in financial services. More details to come soon. | 15 comments on LinkedIn

Reliability in data pipelines depends on knowing what went wrong before your users do. With the new OpenTelemetry integration in our RDF ETL framework barnard59, every pipeline and API integration is now fully traceable! Errors, validation results and performance metrics are automatically collected and visualised in Grafana. Instead of hunting through logs, you immediately see where time was spent and where an error occurred. This makes RDF-based ETL pipelines far more transparent and easier to operate at scale.

Part I

SynaLinks is an open-source framework designed to make it easier to partner language models (LMs) with your graph technologies. Since most companies are not in a position to train their own language models from scratch, SynaLinks empowers you to adapt existing LMs on the market to specialized tasks.

In the history of data standards, a recurring pattern should concern anyone working in semantics today. A new standard emerges, promises interoperability, gains adoption across industries or agencies, and for a time seems to solve the immediate need.

XOPS Raises $40 Million in Funding

MIRAGE: Scaling Test-Time Inference with Parallel Graph-Retrieval-Augmented Reasoning Chains ... When AI Diagnoses Patients, Should Reasoning Be a Team Sport? 👉 Why Existing Approaches Fall Short Medical question answering demands precision, but current AI methods struggle with two key issues: 1. Error Accumulation: Linear reasoning chains (like Chain-of-Thought) risk compounding mistakes—if the first step is wrong, the entire answer falters. 2. Flat Knowledge Retrieval: Traditional retrieval-augmented methods treat medical facts as unrelated text snippets, ignoring complex relationships between symptoms, diseases, and treatments. This leads to unreliable diagnoses and opaque decision-making—a critical problem when patient outcomes are at stake. 👉 What MIRAGE Does Differently MIRAGE transforms reasoning from a solo sprint into a coordinated team effort: - Parallel Detective Work: Instead of one linear chain, multiple specialized "detectives" (reasoning chains) investigate different symptoms or entities in parallel. - Structured Evidence Hunting: Retrieval operates on medical knowledge graphs, tracing connections between symptoms (e.g., "face pain → lead poisoning") rather than scanning documents. - Cross-Check Consensus: Answers from parallel chains are verified against each other to resolve contradictions, like clinicians discussing differential diagnoses. 👉 How It Works (Without the Jargon) 1. Break It Down   - Splits complex queries ("Why am I fatigued with knee pain?") into focused sub-questions grounded in specific symptoms/entities.   - Example: "Conditions linked to fatigue" and "Causes of knee lumps" become separate investigation threads. 2. Graph-Guided Retrieval   - Each thread explores a medical knowledge graph like a map:    - Anchor Mode: Examines direct connections (e.g., diseases causing a symptom).    - Bridge Mode: Hunts multi-step relationships (e.g., toxin exposure → neurological symptoms → joint pain). 3. Vote & Verify   - Combines evidence from all threads, prioritizing answers supported by multiple independent chains.   - Discards conflicting hypotheses (e.g., ruling out lupus if only one chain suggests it without corroboration). 👉 Why This Matters Tested on three medical benchmarks (including real clinician queries), MIRAGE: - Outperformed GPT-4 and Tree-of-Thought variants in accuracy (84.8% vs. 80.2%) - Reduced error propagation by 37% compared to linear retrieval-augmented methods - Produced answers with traceable evidence paths, critical for auditability in healthcare The Big Picture MIRAGE shifts AI reasoning from brittle, opaque processes to collaborative, structured exploration. By mirroring how clinicians synthesize information from multiple angles, it highlights a path toward AI systems that are both smarter and more trustworthy in high-stakes domains. Paper: Wei et al. MIRAGE: Scaling Test-Time Inference with Parallel Graph-Retrieval-Augmented Reasoning Chains

𝗛𝗼𝘁 𝘁𝗮𝗸𝗲 𝗼𝗻 𝘁𝗵𝗲 “𝗳𝗮𝘀𝘁𝗲𝗿 𝘁𝗵𝗮𝗻 𝗗𝗶𝗷𝗸𝘀𝘁𝗿𝗮” 𝗵𝗲𝗮𝗱𝗹𝗶𝗻𝗲𝘀: The recent result given in the paper: https://lnkd.in/dQSbqrhD is a breakthrough for theory. It beats Dijkstra’s classic worst-case bound for single-source shortest paths on directed graphs with non-negative weights. That’s big for the research community. 𝗕𝘂𝘁 𝗶𝘁 𝗱𝗼𝗲𝘀𝗻’𝘁 “𝗿𝗲𝘄𝗿𝗶𝘁𝗲” 𝗽𝗿𝗼𝗱𝘂𝗰𝘁𝗶𝗼𝗻 𝗿𝗼𝘂𝘁𝗶𝗻𝗴. In practice, large-scale systems (maps, logistics, ride-hailing) moved past plain Dijkstra years ago. They rely on heavy preprocessing. Contraction Hierarchies, Hub Labels and other methods are used to answer point-to-point queries in milliseconds, even on large, continental networks. 𝗪𝗵𝘆 𝘁𝗵𝗲 𝗱𝗶𝘀𝗰𝗼𝗻𝗻𝗲𝗰𝘁?  • Different goals: The paper targets single-source shortest paths; production prioritizes point-to-point queries at interactive latencies.  • Asymptotics vs. constants: Beating O(m + n log n) matters in principle, but real systems live and die by constants, cache behavior, and integration with traffic/turn costs.  • Preprocessing wins: Once you allow preprocessing, the speedups from hierarchical/labeling methods dwarf Dijkstra and likely any drop-in replacement without preprocessing. We should celebrate the theoretical advance and keep an eye on practical implementations. Just don’t confuse a sorting-barrier result with an immediate upgrade for Google Maps. 𝗕𝗼𝘁𝘁𝗼𝗺 𝗹𝗶𝗻𝗲: Great theory milestone. Production routing already “changed the rules” years ago with preprocessing and smart graph engineering.

Guest Author: André Vermeij, Founder of Kenedict Innovation Analytics & Developer of...

Amazon Neptune version 1.4.5 introduces engine improvements and support for AWS Graviton-based r8g instances. In this post, we show you how these updates can improve your graph database performance and reduce costs. We walk you through the benchmark results for Gremlin and openCypher comparing Neptune v1.4.5 on r8g instances against previous versions. You'll see performance improvements of up to 4.7x for write throughput and 3.7x for read throughput, along with the cost implications.

🚀 Faster than Dijkstra? Tsinghua University’s new shortest path algorithm just rewrite the rules of graph traversal. For 65+ years, Dijkstra’s algorithm was the gold standard for finding shortest paths in weighted graphs. But now, a team from Tsinghua University has introduced a recursive partial ordering method that outperforms Dijkstra—especially on directed graphs. 🔍 What’s different?  Instead of sorting all vertices by distance (which adds log-time overhead), this new approach uses a clever recursive structure that breaks the O(m + n log n) barrier ✨.  It’s faster, leaner, and already winning awards at STOC 2025 🏆. 📍 Why it matters:  Think Google Maps, Uber routing, disaster evacuation planning, circuit design—any system that relies on real-time pathfinding across massive graphs. Paper ➡ https://lnkd.in/dGTdRj2X #Algorithms #ComputerScience #Engineering #Dijkstra #routing #planning #logistic | 34 comments on LinkedIn

A look at the RDF Shape Constraint Language

I’m proud to share an exciting piece of work by my PhD student, Simon van Wageningen, whom I have the pleasure of supervising. Simon asked a bold question that challenges the state of the art in our field! A bit of background first: together with Simon, we study network visualizations — those diagrams made of dots and lines. They’re more than just pretty pictures: they help us gain intuition about the structure of networks around us, such as social networks, protein networks, or even money-laundering networks 😉. But how do we know if a visualization really shows the structure well? That’s where quality metrics come in — mathematical functions designed to measure the “goodness” of a network visualization. Many of these metrics correlate nicely with human intuition. Yet, in our community, there has long been a belief — more of a tacit knowledge — that these metrics fail in certain cases. This is exactly where Simon’s work comes in: he set out to make this tacit knowledge explicit. Take a look at the dancing man and the network in the slider — they represent the same network with very similar quality metric values. And yet, the dancing man clearly does not don’t show the network's structure. This tells us something important: we can’t blindly rely on quality metrics. Simon’s work will be presented at the International Symposium on Graph Drawing and Network Visualization in Norrköping, Sweden this year. 🎉 If you’d like to dive deeper, here’s the link to the GitHub repository https://lnkd.in/eqw3nYmZ #graphdrawing #networkvisualization #qualitymetrics #research with Simon van Wageningen and Alex Telea | 13 comments on LinkedIn

Sign in or join now to see posts like this one and more.

Building a knowledge graph? Start here. Ask these 15 practical questions to avoid common pitfalls and design with confidence.