# graph-database

A database technology that models data as interconnected entities and relationships, using graph theory and graph queries.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## CVE-2026-125080 - Cypher injection via orderBy placeholder in Spring Data Neo4j custom queries

DevFeed: [CVE-2026-125080 - Cypher injection via orderBy placeholder in Spring Data Neo4j custom queries](<https://devfeed.tech/articles/cve-2026-125080-cypher-injection-via-orderby-placeholder-in-spring-data-neo4j-custom-queries-145904.md>)

Original publisher: [Read original article](<https://cvefeed.io/vuln/detail/CVE-2026-125080>)

Author: CVEFEED.io

Published: 2026-11-20T09:19:56Z

Content type: news

Language: en

Sources: [Latest High/Critical Vulnerabilitiy Feed](<https://devfeed.tech/sources/latest-high-critical-vulnerabilitiy-feed.md>)

Topics: [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [cve](<https://devfeed.tech/tags/cve.md>), [cve-2026-125080](<https://devfeed.tech/tags/cve-2026-125080.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [database](<https://devfeed.tech/tags/database.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [queries](<https://devfeed.tech/tags/queries.md>), [spring](<https://devfeed.tech/tags/spring.md>), [spring-data](<https://devfeed.tech/tags/spring-data.md>), [spring-data-neo4j](<https://devfeed.tech/tags/spring-data-neo4j.md>)

### AI overview

CVE-2026-125080 is a high-severity Cypher injection in Spring Data Neo4j custom-query handling of the `orderBy` placeholder. A remote attacker can exploit it when an application passes unvalidated user input as the sort-order value, potentially reading database contents through blind reads or writing read content into new nodes. Writing query results to files is also possible when APOC and APOC file export are enabled; that path is conditional. The description lists affected versions as 6.1.0-8.0.8 and 8.1.0-8.1.2, and gives a severity score of 8.2.

### Source excerpt

CVE ID :CVE-2026-125080 Published : Nov. 20, 2026, 9:19 a.m. | 1 hour, 42 minutes ago Description :Improper neutralization of special elements in data query logic (Cypher injection) in the orderBy placeholder handling for custom queries in Neo4j Spring Data Neo4j versions 6.1.0 through 8.0.8 and 8.1.0 through 8.1.2 allows a remote attacker to read database contents via blind reads, write read content into new nodes, or, if APOC and APOC file export are enabled, to write query results to a file in the database's accessible file system via crafted sort order parameters. Exploitation requires an application that passes unvalidated user input as the orderBy value to a custom Cypher query using the placeholder directive. Severity: 8.2 | HIGH Visit the link for more details, such as CVSS details, affected products, timeline, and more...

## What is a semantic knowledge graph, and does your AI need one?

DevFeed: [What is a semantic knowledge graph, and does your AI need one?](<https://devfeed.tech/articles/what-is-a-semantic-knowledge-graph-and-does-your-ai-need-one-140278.md>)

Original publisher: [Read original article](<https://www.cio.com/article/4249101/what-is-a-semantic-knowledge-graph-and-does-your-ai-need-one.html>)

Author: Maria Korolov

Published: 2026-11-18T10:00:00Z

Content type: article

Language: en

Sources: [CIO](<https://devfeed.tech/sources/cio.md>)

Topics: [semantic-layer](<https://devfeed.tech/topics/semantic-layer.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [база знаний](<https://devfeed.tech/topics/tag-c51cc4bf76e5.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [knowledge-management](<https://devfeed.tech/topics/knowledge-management.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>)

Tags: [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [analytics-artificial-intelligence-data-engineering-data-governance-data-management-databases-e](<https://devfeed.tech/tags/analytics-artificial-intelligence-data-engineering-data-governance-data-management-databases-e.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [business](<https://devfeed.tech/tags/business.md>), [data](<https://devfeed.tech/tags/data.md>), [data-engineering](<https://devfeed.tech/tags/data-engineering.md>), [data-governance](<https://devfeed.tech/tags/data-governance.md>), [data-lake](<https://devfeed.tech/tags/data-lake.md>), [data-lakehouse](<https://devfeed.tech/tags/data-lakehouse.md>), [data-management](<https://devfeed.tech/tags/data-management.md>), [database](<https://devfeed.tech/tags/database.md>), [databases](<https://devfeed.tech/tags/databases.md>), [dependencies](<https://devfeed.tech/tags/dependencies.md>), [edge](<https://devfeed.tech/tags/edge.md>), [edition-us](<https://devfeed.tech/tags/edition-us.md>), [emerging-technology](<https://devfeed.tech/tags/emerging-technology.md>), [employee](<https://devfeed.tech/tags/employee.md>), [erp](<https://devfeed.tech/tags/erp.md>), [explain](<https://devfeed.tech/tags/explain.md>), [flexible](<https://devfeed.tech/tags/flexible.md>), [graph](<https://devfeed.tech/tags/graph.md>), [it-leadership](<https://devfeed.tech/tags/it-leadership.md>), [it-strategy](<https://devfeed.tech/tags/it-strategy.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [language-en](<https://devfeed.tech/tags/language-en.md>), [risk-management](<https://devfeed.tech/tags/risk-management.md>), [security](<https://devfeed.tech/tags/security.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [storytype-feature](<https://devfeed.tech/tags/storytype-feature.md>)

### AI overview

A semantic knowledge graph gives AI agents both connected enterprise data and context about what that data means and how the business uses it. The excerpt contrasts tables with graph databases, where nodes and edges make relationships easier to traverse, and explains that a semantic layer can encode concepts such as client status, job roles, workflows, and business priorities. At Cosentino, a human-led project augmented by AI helped agents identify delayed orders and their causes; the company reports shorter delays for credit-blocked orders and savings, while noting that building and maintaining the layer still requires skilled human oversight. New York Life uses knowledge graphs for multi-agent orchestration and vector databases for generative AI retrieval of unstructured information. The text presents the approaches as serving different uses and says graph-based retrieval can provide more targeted context with fewer irrelevant materials and tokens. It also cautions that AI-generated relationships may be wrong and that model inaccuracies can compound across agent calls.

### Source excerpt

A traditional database organizes information into tables. One column is the name, another is the company they work for. A graph database stores the same information not in tables but in nodes and edges. A person could be one node, the company they work for is another, and the edge is the connection between the two. Any node can be connected to any other one, making graph databases much more flexible. And finding related entities is as simple as following the edges from one node to another. They're useful for navigating supply chain dependencies, detecting fraud, or mapping user preferences to make better recommendations. All of that is already potentially useful to AI agents, but that's not all. A knowledge graph sits on top of the graph database and is a map of the relationships. The node with the person's name, for example, could be connected to the node with the company information because the person is an employee of that company. The knowledge graph helps explain what the data is. A semantic graph, or a semantic knowledge graph, takes this one step further and adds a deeper level of meaning. For example, the list of companies could actually be a list of clients or potential clients. The list of people could also be potential contacts for sales calls, and their job titles could indicate their relative importance. The semantic layer is all about what the data means for the enterprise and how the data is actually used in practice. When AI agents are assigned actual work tasks, they need to have this information. "Agentic AI is AI that can do things, not just tell you things," says Rafael Domene, global CIO at manufacturing company Cosentino. "But you have to provide what AI needs to do the job in the right way. Not just data, but information. It's about business knowledge and understanding what's going on." Cosentino had already invested a lot of money into a massive data lake and data lakehouse, as well as ERP and CRM systems. "You can collect all the data, but t

## Evaluating AST-Derived Knowledge Graph Retrieval for AIOps Incident Diagnosis in Apache Kafka

DevFeed: [Evaluating AST-Derived Knowledge Graph Retrieval for AIOps Incident Diagnosis in Apache Kafka](<https://devfeed.tech/articles/evaluating-ast-derived-knowledge-graph-retrieval-for-aiops-incident-diagnosis-in-apache-kafka-139584.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21625>)

Author: Shashank Mishra, Shweta Mishra

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Apache Kafka](<https://devfeed.tech/topics/apache-kafka.md>), [AIOps](<https://devfeed.tech/topics/aiops.md>), [search-engines](<https://devfeed.tech/topics/search-engines.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Parsing](<https://devfeed.tech/topics/parsing.md>)

Tags: [aiops](<https://devfeed.tech/tags/aiops.md>), [apache-kafka](<https://devfeed.tech/tags/apache-kafka.md>), [ast](<https://devfeed.tech/tags/ast.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [diagnosis](<https://devfeed.tech/tags/diagnosis.md>), [graph](<https://devfeed.tech/tags/graph.md>), [incident](<https://devfeed.tech/tags/incident.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [log](<https://devfeed.tech/tags/log.md>), [queries](<https://devfeed.tech/tags/queries.md>), [reranking](<https://devfeed.tech/tags/reranking.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [source](<https://devfeed.tech/tags/source.md>)

### AI overview

In Apache Kafka incident diagnosis, vector-only retrieval achieved Recall@20 of 0.956, and adding static or confidence-guided staged AST ownership-graph expansion did not significantly improve recall. Staging did reduce cross-encoder pair workload and measured reranking time by about 52% compared with static expansion. As an external control, HippoRAG scored 0.308 versus 0.803 for its ColBERTv2-only backbone; a post-hoc document ensemble raised its score to 0.648 but did not close the gap. In a manually evaluated 100-query study, AST-derived structural evidence showed no significant advantage in root-cause correctness. The findings are based on 1,600 source-linked log records and a 315-query benchmark covering 103 targets.

### Source excerpt

arXiv:2611.21625v1 Announce Type: new Abstract: Incident diagnosis requires retrieving source-linked operational evidence from large codebases. We evaluate graph-augmented retrieval for Apache Kafka using an abstract-syntax-tree (AST)-derived ownership graph over 1,600 source-linked log records and an audited benchmark of 315 incident-style queries covering 103 unique targets. Vector-only retrieval is a strong baseline at Recall@20 of 0.956, and neither static nor confidence-guided staged AST expansion significantly improves Recall@20 over it. As an external control we evaluate HippoRAG, a published text-derived graph-retrieval system, against its own ColBERTv2 retrieval backbone. Against ColBERTv2-only (Recall@20 0.803), HippoRAG attained 0.308; a post-hoc document-ensemble sensitivity raised Recall@20 to 0.648 but did not eliminate the deficit. Relative to static expansion, staging reduces cross-encoder pair workload and measured reranking time by about 52%. A manually evaluated 100-query downstream study finds no significant root-cause-correctness advantage for AST-derived structural evidence.

## TETRA Wants to Reinvent the Database. Its Ambitions Go Much Further

DevFeed: [TETRA Wants to Reinvent the Database. Its Ambitions Go Much Further](<https://devfeed.tech/articles/tetra-wants-to-reinvent-the-database-its-ambitions-go-much-further-136917.md>)

Original publisher: [Read original article](<https://hackernoon.com/tetra-wants-to-reinvent-the-database-its-ambitions-go-much-further?source=rss>)

Author: George Anadiotis

Published: 2026-11-17T06:46:40Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [database-optimization](<https://devfeed.tech/topics/database-optimization.md>), [database-scalability](<https://devfeed.tech/topics/database-scalability.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [observability](<https://devfeed.tech/topics/observability.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [3](<https://devfeed.tech/tags/3.md>), [about](<https://devfeed.tech/tags/about.md>), [actor](<https://devfeed.tech/tags/actor.md>), [added](<https://devfeed.tech/tags/added.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agentic-workflow](<https://devfeed.tech/tags/agentic-workflow.md>), [approach](<https://devfeed.tech/tags/approach.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [based](<https://devfeed.tech/tags/based.md>), [data](<https://devfeed.tech/tags/data.md>), [data-modeling](<https://devfeed.tech/tags/data-modeling.md>), [data-science](<https://devfeed.tech/tags/data-science.md>), [database](<https://devfeed.tech/tags/database.md>), [database-architecture](<https://devfeed.tech/tags/database-architecture.md>), [execution](<https://devfeed.tech/tags/execution.md>), [future-technology](<https://devfeed.tech/tags/future-technology.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [innovation](<https://devfeed.tech/tags/innovation.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [one](<https://devfeed.tech/tags/one.md>), [query](<https://devfeed.tech/tags/query.md>), [storage](<https://devfeed.tech/tags/storage.md>), [system](<https://devfeed.tech/tags/system.md>), [tetra](<https://devfeed.tech/tags/tetra.md>)

### AI overview

TETRAbase uses one matrix representation for data, storage and query execution: it supports openCypher and SQL over that shared representation, applying exact numerical operations rather than LLM-style probabilistic inference. It loads query-needed data into working memory instead of keeping the full dataset in RAM, and the article says it runs on multicore CPUs without database-layer GPUs, indexes or cache. TETRA claims these choices can reduce query time, memory and infrastructure needs. Its reported benchmark results are company-published and not independently audited. The article also distinguishes a projected electricity reduction of more than 40%, based on TETRA's modelling, from measured deployment results. TETRAbase is in beta with design partners; correctness and edge-case testing continue. TETRAplex is a planned workflow system aimed at explicit failure handling and observability, with broader claims still to be demonstrated in deployments.

### Source excerpt

Discover Collapsive Architecture: TETRA's matrix-based approach to bringing data representation, storage and query execution into one system.

## Robust Recursive Query Parallelism in Graph Database Management Systems

DevFeed: [Robust Recursive Query Parallelism in Graph Database Management Systems](<https://devfeed.tech/articles/robust-recursive-query-parallelism-in-graph-database-management-systems-138278.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2508.19379>)

Author: Anurag Chakraborty, Semih Saliho\\u{g}lu

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Parallelism](<https://devfeed.tech/topics/parallelism.md>), [database-optimization](<https://devfeed.tech/topics/database-optimization.md>)

Tags: [breadth-first-search](<https://devfeed.tech/tags/breadth-first-search.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-pf](<https://devfeed.tech/tags/cs-pf.md>), [database](<https://devfeed.tech/tags/database.md>), [database-management](<https://devfeed.tech/tags/database-management.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [multi-core](<https://devfeed.tech/tags/multi-core.md>), [parallelism](<https://devfeed.tech/tags/parallelism.md>), [performance](<https://devfeed.tech/tags/performance.md>), [query](<https://devfeed.tech/tags/query.md>), [robust](<https://devfeed.tech/tags/robust.md>)

### AI overview

The study treats recursive-query parallelism in graph database management systems as a choice of morsel granularity. It compares source-node-level and frontier-level dispatch, then combines them in a hybrid policy implemented in Kuzu and evaluated across datasets, workloads, and other systems. The reported hybrid captures cases where either single-granularity policy performs well and outperforms them when they are limited. Packing multiple source nodes into multi-source morsels reduces scans, but the benefit appears only when queries have enough sources. These findings are based on the abstract provided.

### Source excerpt

arXiv:2508.19379v2 Announce Type: replace Abstract: Efficient multi-core parallel processing of recursive join queries is critical for achieving good performance in graph database management systems (GDBMSs). Prior work adopts two broad approaches. First is the state of the art morsel-driven parallelism, whose vanilla application in GDBMSs parallelizes computations at the source node level. Second is to parallelize each iteration of the computation at the frontier level. We show that these approaches can be seen as part of a design space of morsel dispatching policies based on picking different granularities of morsels. We then empirically study the question of which policies parallelize better in practice under a variety of datasets and query workloads that contain one to many source nodes. We show that these two policies can be combined in a hybrid policy that issues morsels both at the source node and frontier levels. We then show that the multi-source breadth-first search optimization from prior work can also be modeled as a morsel dispatching policy that packs multiple source nodes into multi-source morsels. We implement these policies inside a single system, the Kuzu GDBMS, and evaluate them both within Kuzu and across other systems. We show that the hybrid policy captures the behavior of both source morsel-only and frontier morsel-only policies in cases when these approaches parallelize well, and out-perform them on queries when they are limited, and propose it as a robust approach to parallelizing recursive queries. We further show that assigning multi-sources is beneficial, as it reduces the amount of scans, but only when there is enough sources in the query.

## Living Context Graphs: Continual Semantic Learning for Enterprise Data Reasoning

DevFeed: [Living Context Graphs: Continual Semantic Learning for Enterprise Data Reasoning](<https://devfeed.tech/articles/living-context-graphs-continual-semantic-learning-for-enterprise-data-reasoning-137638.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20976>)

Author: Varun Agrawal, Ayush Srivastava, Eshan Gujar, Kaushal Kumar, Ayush Gupta

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [semantic-layer](<https://devfeed.tech/topics/semantic-layer.md>), [text2sql](<https://devfeed.tech/topics/text2sql.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bootstrapping](<https://devfeed.tech/tags/bootstrapping.md>), [business-context](<https://devfeed.tech/tags/business-context.md>), [context-graphs](<https://devfeed.tech/tags/context-graphs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-et](<https://devfeed.tech/tags/cs-et.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [databases](<https://devfeed.tech/tags/databases.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [enterprise-ai](<https://devfeed.tech/tags/enterprise-ai.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [learning](<https://devfeed.tech/tags/learning.md>), [learnings](<https://devfeed.tech/tags/learnings.md>), [meaning](<https://devfeed.tech/tags/meaning.md>), [metric](<https://devfeed.tech/tags/metric.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

Living Context Graph (LCG) makes existing enterprise data usable for AI without copying or transforming the warehouse. It derives initial semantics and relationships from data, indexes business context in a concept graph as queries are served, and stores learnings from verified outcomes; it can withdraw or relearn context when later results contradict earlier routes. In text-to-SQL tests across three BIRD databases (499 questions), bootstrapping improved overall accuracy by 4.6 percentage points. Learning from 353 history questions improved accuracy on 146 untouched transfer questions by 22.6 points (95% CI +14.4 to +30.8), 12.3 points more than five-shot retrieval from the same history. Incremental learning reached the one-shot endpoint within observed evaluation noise on each database. Removing the graph changed held-out accuracy by at most one question per database, but raised per-query cost 2.3-3.3x and median latency 1.8-3.4x.

### Source excerpt

arXiv:2611.20976v1 Announce Type: cross Abstract: Enterprise AI can now perform analytics, reporting, and data-driven workflows, yet the data foundations it relies on remain hard to operationalize: business meaning, relationships, metric definitions, and reporting conventions are absent from database schemas and scattered across undocumented systems and tribal knowledge. We introduce the Living Context Graph (LCG), a continually learned context layer that makes existing enterprise data operational for AI without requiring a copy or transformation of the underlying warehouse. LCG bootstraps base semantics and relationships from the data itself, builds a concept graph that indexes business context as queries are served, writes durable semantic learnings from verified outcomes, and withdraws or re-earns context when later outcomes contradict prior routes. We evaluate LCG through text-to-SQL, a core data-reasoning task, on a transfer-aware split of three BIRD databases comprising 499 questions: 353 form the learning history and 146 are held out and never used to update the context layer. Bootstrapping alone improves overall accuracy by +4.6 percentage points. Learning only from the history raises accuracy on the untouched held-out transfer set by +22.6 points (95% CI [+14.4, +30.8]), exceeding five-shot retrieval from the same history by +12.3 points. Incremental learning reaches the one-shot endpoint within observed evaluation noise on every database. Ablating the graph changes held-out accuracy by at most one question per database but increases per-query cost 2.3-3.3x and median latency 1.8-3.4x: continually learned semantics drive accuracy, while the graph makes that context efficient to serve.

## Neo4j Virtual Graph is now generally available

DevFeed: [Neo4j Virtual Graph is now generally available](<https://devfeed.tech/articles/neo4j-virtual-graph-is-now-generally-available-135999.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/news/neo4j-virtual-graph-is-now-generally-available/>)

Author: Stu Moore

Published: 2026-11-16T17:25:06Z

Content type: release

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Graph Mining](<https://devfeed.tech/topics/graph-mining.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-workflows](<https://devfeed.tech/tags/agent-workflows.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [airport](<https://devfeed.tech/tags/airport.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analyst](<https://devfeed.tech/tags/analyst.md>), [analysts](<https://devfeed.tech/tags/analysts.md>), [aura](<https://devfeed.tech/tags/aura.md>), [aura-graph-analytics](<https://devfeed.tech/tags/aura-graph-analytics.md>), [aws](<https://devfeed.tech/tags/aws.md>), [azure](<https://devfeed.tech/tags/azure.md>), [connected-data](<https://devfeed.tech/tags/connected-data.md>), [cypher-gql](<https://devfeed.tech/tags/cypher-gql.md>), [etl](<https://devfeed.tech/tags/etl.md>), [fraud-detection](<https://devfeed.tech/tags/fraud-detection.md>), [gcp](<https://devfeed.tech/tags/gcp.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [graph-technology](<https://devfeed.tech/tags/graph-technology.md>), [graph-visualization](<https://devfeed.tech/tags/graph-visualization.md>), [graphrag](<https://devfeed.tech/tags/graphrag.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [neo4j-aura](<https://devfeed.tech/tags/neo4j-aura.md>), [news](<https://devfeed.tech/tags/news.md>), [security](<https://devfeed.tech/tags/security.md>), [virtual-graph](<https://devfeed.tech/tags/virtual-graph.md>), [zero](<https://devfeed.tech/tags/zero.md>)

### AI overview

Neo4j Virtual Graph is generally available in Aura on GCP, with AWS and Azure support described as coming soon. It maps warehouse tables into a graph and translates Cypher queries into deterministic SQL executed in Snowflake, Databricks, Iceberg tables on S3, or BigQuery; data stays in the warehouse, and its access follows the connecting role's permissions and masking. Users can model graphs manually, from schema, or with AI, then query them through Neo4j tools and drivers. The excerpt highlights bounded quantified path patterns for traversals such as fraud and supply chain analysis, plus monitoring, pause/resume, and Private Link for dedicated environments. Virtual Graph is read-only and supports only part of Cypher; unsupported queries return error 42NG1. Warehouse execution means latency depends on compute and query complexity, with responses expected in seconds or minutes. The excerpt recommends AuraDB when writes, full Cypher, or millisecond response times are required. External IdPs, Aura MCP integration, and multi-source graphs are listed as forthcoming.

### Source excerpt

First on GCP, coming soon to AWS and Azure Today, Neo4j Virtual Graph is generally available in Neo4j Aura on GCP, with support for AWS and Azure to follow soon. Virtual Graph lets you build zero-ETL knowledge graphs, GraphRAG systems,... Read more ->

## Euler meets Codd

DevFeed: [Euler meets Codd](<https://devfeed.tech/articles/euler-meets-codd-135998.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/developer/euler-meets-codd/>)

Author: christoffer bergman

Published: 2026-11-16T11:43:00Z

Content type: article

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [databricks](<https://devfeed.tech/topics/databricks.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [SQL](<https://devfeed.tech/topics/sql.md>), [BigQuery](<https://devfeed.tech/topics/bigquery.md>), [Snowflake streaming data architecture](<https://devfeed.tech/topics/snowflake-streaming-data-architecture.md>)

Tags: [analytics](<https://devfeed.tech/tags/analytics.md>), [aura](<https://devfeed.tech/tags/aura.md>), [aura-graph-analytics](<https://devfeed.tech/tags/aura-graph-analytics.md>), [bigquery](<https://devfeed.tech/tags/bigquery.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [cypher-gql](<https://devfeed.tech/tags/cypher-gql.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [databricks](<https://devfeed.tech/tags/databricks.md>), [developer](<https://devfeed.tech/tags/developer.md>), [fraud-detection](<https://devfeed.tech/tags/fraud-detection.md>), [graph](<https://devfeed.tech/tags/graph.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [query](<https://devfeed.tech/tags/query.md>), [snowflake](<https://devfeed.tech/tags/snowflake.md>), [sql](<https://devfeed.tech/tags/sql.md>), [virtual-graph](<https://devfeed.tech/tags/virtual-graph.md>)

### AI overview

Neo4j Virtual Graphs let users query relational data in Databricks with Cypher and explore it through Neo4j graph tools without copying the data. In a fraud-ring example, the author maps account and transaction tables to graph nodes and relationships, then finds chronologically ordered, decreasing transfers that return to their starting account. A bounded query returned the same rings as a native Neo4j graph, taking about 25 seconds versus 1.5 seconds; the author cautions this was not a scientific benchmark. Virtual Graphs provide graph query expression and visualization, but not native graph traversal speed, and the example required an upper bound because unbounded variable-length queries are unsupported. The described setup uses Aura, a paid feature requiring a credit card. The article says users can later import the data into a native graph using the same data source and model.

### Source excerpt

Neo4j Virtual Graph lets you query relational data in Databricks, Snowflake, BigQuery and similar platforms with Cypher/GQL, using Neo4j's full suite of graph tools.

## Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration

DevFeed: [Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration](<https://devfeed.tech/articles/samyama-a-unified-graph-vector-database-with-in-database-optimization-agentic-enrichment-and-hardware-acceleration-135433.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.08036>)

Author: Madhulatha Mandarapu, Sandeep Kunkunuru

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>), [database-optimization](<https://devfeed.tech/topics/database-optimization.md>), [RDF (Resource Description Framework)](<https://devfeed.tech/topics/rdf.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [RAPIDS](<https://devfeed.tech/topics/rapids.md>)

Tags: [22](<https://devfeed.tech/tags/22.md>), [acceleration](<https://devfeed.tech/tags/acceleration.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cuda](<https://devfeed.tech/tags/cuda.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [database](<https://devfeed.tech/tags/database.md>), [database-optimization](<https://devfeed.tech/tags/database-optimization.md>), [databases](<https://devfeed.tech/tags/databases.md>), [edge](<https://devfeed.tech/tags/edge.md>), [enrichment](<https://devfeed.tech/tags/enrichment.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [hardware-acceleration](<https://devfeed.tech/tags/hardware-acceleration.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-database](<https://devfeed.tech/tags/vector-database.md>)

### AI overview

Samyama combines graph and vector storage, analytics, RDF/SPARQL, 22 query-callable metaheuristic solvers, and LLM-based graph enrichment in a Rust engine. At v1.8.0, tests on rented Linux hosts report 123K-152K nodes/s ingestion and PageRank iterations of 6.7 ms at 10,000 nodes and 236 ms at one million on a 16-vCPU instance. On an NVIDIA A16, CUDA matches CPU performance at 10,000 nodes and reaches 1.62x and 2.70x at 100,000 and one million, respectively, with 1.1-1.35 seconds of first-call context initialization. The abstract withdraws earlier GPU, Cypher-throughput, index-scaling, and vector-search figures as unreproducible. It reports 99.9% of evaluated openCypher TCK scenarios passing; in a same-host comparison with Neo4j 5 and FalkorDB, all 14 complex reads were within 5x of the best competitor and 7 were faster.

### Source excerpt

arXiv:2603.08036v4 Announce Type: replace Abstract: Modern data architectures fragment across graph databases, vector stores, analytics engines and optimization solvers, forcing ETL between them. We present Samyama, a graph-vector database in Rust that unifies these workloads in one engine: a RocksDB-backed store with MVCC, a vectorized executor, a cost-based planner, a CSR analytics engine, RDF and SPARQL, 22 metaheuristic solvers callable from the query language, HNSW vector indexing, and agentic enrichment that expands a graph via LLMs. It has been run to billion-edge scale: 74.3M nodes and 1.07B edges from four biomedical sources on one machine for $2.50 of spot compute. This version re-measures the system at release v1.8.0 on rented Linux hosts a reader can boot, replacing earlier figures taken on a Mac Mini that nobody could re-run. On a 16-vCPU cloud instance, ingestion reaches 123K-152K nodes/s and PageRank costs 6.7 ms per iteration at ten thousand nodes and 236 ms at a million. The previously reported 8.2x GPU speedup is withdrawn; in its place we measure the CUDA path, which no earlier version measured at all, on a rented NVIDIA A16: parity with the CPU at ten thousand nodes, 1.62x at a hundred thousand and 2.70x at a million, with 1.1-1.35 s of context initialisation on the first call. The earlier Cypher-throughput figure, its claim of near-constant index-driven scaling, and a vector-search figure are withdrawn as unreproducible. openCypher conformance, once estimated at ~90%, is now measured at 99.9% of evaluated TCK scenarios. Against Neo4j 5 and FalkorDB on one host over an identical SF10 extract, 14 of 14 SNB complex reads land within 5x of the best competitor and 7 of 14 are faster.

## KG-Guard: Graph-Based Hallucination Detection for Knowledge Base Question Answering

DevFeed: [KG-Guard: Graph-Based Hallucination Detection for Knowledge Base Question Answering](<https://devfeed.tech/articles/kg-guard-graph-based-hallucination-detection-for-knowledge-base-question-answering-132800.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.00328>)

Author: Albert Sawczyn, Piotr Bielak, Tomasz Kajdanowicz

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [база знаний](<https://devfeed.tech/topics/tag-c51cc4bf76e5.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [LLM security](<https://devfeed.tech/topics/llm-security.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [detection](<https://devfeed.tech/tags/detection.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hallucination-detection](<https://devfeed.tech/tags/hallucination-detection.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [knowledge-base](<https://devfeed.tech/tags/knowledge-base.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [llm](<https://devfeed.tech/tags/llm.md>), [mlp](<https://devfeed.tech/tags/mlp.md>), [node](<https://devfeed.tech/tags/node.md>), [question](<https://devfeed.tech/tags/question.md>)

### AI overview

KG-Guard detects hallucinated answer entities in knowledge base question answering by classifying each proposed answer node with a lightweight graph-based verifier that treats the answering LLM as a black box. It builds an augmented graph from the question, topic entities, and proposed answers, then combines graph representations with the question embedding. On WebQSP, ComplexWebQuestions, and PUGG, the authors report F1 scores of 82.0, 87.4, and 84.3, respectively, and the best average rank across the three benchmarks, using about 305 times fewer parameters than LLM-based baselines. Feeding flagged answers back for iterative refinement reportedly improves downstream F1 by 13.0-14.5 points and Exact Match by 16.9-17.6 points. These results are limited to the reported benchmarks, pipelines, and settings.

### Source excerpt

arXiv:2606.00328v2 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used for knowledge base question answering (KBQA), also referred to as knowledge graph question answering (KGQA), where answering requires selecting entities from a question-specific knowledge graph subgraph. Yet LLMs are known to hallucinate across tasks, and KBQA is no exception: even when we provide a graph as the knowledge source, the model may rely on parametric knowledge instead of graph evidence or perform invalid reasoning over the given relations. Such hallucinated answer nodes can limit the practical deployment of KBQA systems, especially in high-stakes domains such as healthcare. We formulate hallucination detection in KBQA as an answer-node classification problem and propose a lightweight graph-based framework that treats the answering LLM as a black box. KG-Guard represents each KBQA instance as an augmented graph. It initializes node features with semantic representations of KG entities, marks topic entities and LLM-proposed answer nodes with learned vectors, and connects a virtual question node to the topic entities. A graph encoder then produces verification-oriented node representations, and a small MLP classifies each proposed answer node using its graph representation together with the question embedding. Experiments on WebQSP, ComplexWebQuestions, and PUGG show that our detector achieves the best average rank across all three benchmarks (F1 82.0, 87.4, and 84.3), while using ${\sim}$305$\times$ fewer parameters than LLM-based baselines. It also retains the best average rank when jointly evaluated across an extended set of pipelines and settings. Beyond detection, the node-level feedback is actionable: when flagged answers are fed back to the KBQA system for iterative refinement, downstream KBQA F1 improves by 13.0-14.5 points and Exact Match by 16.9-17.6 points.

## AutoOntic: Automatic Ontology Induction from Text for Knowledge Graph Construction

DevFeed: [AutoOntic: Automatic Ontology Induction from Text for Knowledge Graph Construction](<https://devfeed.tech/articles/autoontic-automatic-ontology-induction-from-text-for-knowledge-graph-construction-132134.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15467>)

Author: Alla Chepurova, Aydar Bulatov, Mikhail Burtsev, Yuri Kuratov

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [automatic](<https://devfeed.tech/tags/automatic.md>), [automatically](<https://devfeed.tech/tags/automatically.md>), [classes](<https://devfeed.tech/tags/classes.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deduplication](<https://devfeed.tech/tags/deduplication.md>), [domain](<https://devfeed.tech/tags/domain.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [generation](<https://devfeed.tech/tags/generation.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [hierarchy](<https://devfeed.tech/tags/hierarchy.md>), [induction](<https://devfeed.tech/tags/induction.md>), [intrinsic](<https://devfeed.tech/tags/intrinsic.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [llm](<https://devfeed.tech/tags/llm.md>), [mining](<https://devfeed.tech/tags/mining.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [text](<https://devfeed.tech/tags/text.md>)

### AI overview

AutoOntic builds an ontology from text to address flat knowledge graphs that lack type hierarchies and relation constraints. It canonicalizes open-vocabulary entity types and relations, then induces a type hierarchy using corpus-derived relation-argument profiles and local LLM-adjudicated parent/child checks; inserting a type can reassign existing links. The hierarchy guides entity deduplication and supports mining relation domain and range constraints. On Wikidata-TekGen and DBpedia-WebNLG subsets of Text2KGBench, over 90% of induced endpoint types align semantically with reference classes across two LLM backbones; about half match exactly, and most other differences reflect granularity. On MINE, graphs organized with an AutoOntic-built ontology achieve 88% retrieval accuracy.

### Source excerpt

arXiv:2611.15467v1 Announce Type: cross Abstract: Graph-based retrieval-augmented generation depends on the quality of the knowledge graph (KG) it retrieves over, yet schema-free LLM-based extraction pipelines typically produce flat graphs: deduplicated entities and relations with no type hierarchy and no domain/range constraints. We present AutoOntic, a pipeline that automatically constructs an ontology from text by canonicalizing open-vocabulary entity types and relations, inducing a hierarchy over the canonicalized types, and mining relation-level domain and range constraints. Its hierarchy induction procedure prioritizes types using corpus-derived relation-argument profiles and places them through local, LLM-adjudicated parent/child checks, allowing newly inserted types to trigger reassignment of existing parent-child links. The resulting hierarchy constrains entity deduplication and supports the induction of relation-level domain/range constraints. For intrinsic evaluation, we introduce a reference-based protocol that classifies induced ontology types as exact, broader, narrower, or unrelated to reference domain and range classes. On the Wikidata-TekGen and DBpedia-WebNLG subsets of Text2KGBench, over 90% of AutoOntic's induced endpoint types are semantically aligned with the reference classes across two LLM backbones: about half match exactly, while most remaining differences concern granularity. On MINE, knowledge graphs organized using an ontology built by AutoOntic achieve 88% retrieval accuracy. AutoOntic is available at https://github.com/screemix/AutoOntic.

## HeriKGQA: Grounded Knowledge-Graph Question Answering over Cultural Heritage Sensor Data

DevFeed: [HeriKGQA: Grounded Knowledge-Graph Question Answering over Cultural Heritage Sensor Data](<https://devfeed.tech/articles/herikgqa-grounded-knowledge-graph-question-answering-over-cultural-heritage-sensor-data-132182.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15904>)

Author: Lingxiao Kong, Vasileios Arampatzakis, Vasileios Sevetlidis, George Pavlidis, Zeyd Boukhers

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [база знаний](<https://devfeed.tech/topics/tag-c51cc4bf76e5.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>)

Tags: [crm](<https://devfeed.tech/tags/crm.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [database](<https://devfeed.tech/tags/database.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [grounding](<https://devfeed.tech/tags/grounding.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [natural-language-interface](<https://devfeed.tech/tags/natural-language-interface.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

HeriKGQA aims to prevent errors in cultural-heritage sensor-data question answering by limiting the LLM to interpreting questions and phrasing answers, while SPARQL and deterministic code handle computation. It maps questions to intents constrained by an ontology aligning W3C SOSA/SSN with CIDOC-CRM, then uses query results and grounded temporal, spatial, and anomaly facts; error correction guards each LLM step. In tests on 500 questions from five heritage sites, it achieved 99.0% accuracy--18.2 percentage points above the strongest of three baselines using the same LLM and answer conventions--and ran almost four times faster with comparable answer quality. Without grounding, accuracy fell 12.2 points overall and from 99% to 66% on anomaly questions. These results are reported in the supplied abstract.

### Source excerpt

arXiv:2611.15904v1 Announce Type: cross Abstract: Cultural heritage sites are increasingly monitored by sensor networks, but querying their data requires database expertise. Large Language Models (LLMs) offer a natural-language interface, yet over raw sensor records they lose track of which sensor, site, and time each value belongs to, and silently miscompute. We present HeriKGQA, a knowledge-graph question-answering method that confines the LLM to interpreting questions and phrasing answers, leaving computation to SPARQL and deterministic code. Questions are parsed into intents constrained by a heritage ontology aligning W3C SOSA/SSN with CIDOC-CRM, compiled into SPARQL, and answered from query results and temporal, spatial, and anomaly facts derived by a grounding layer, with error correction guarding each LLM step. On 500 questions over real data from five heritage sites, HeriKGQA reaches 99.0% accuracy, 18.2 points above the strongest of three baselines using the same LLM and receiving the same anomaly rules and answer conventions, with comparable answer quality while running almost four times faster. Without grounding, accuracy drops by 12.2 points and on anomaly questions from 99% to 66%. We report lessons from development and live deployment.

## ANCHOR: Schema-Agnostic Threat Knowledge Graph Construction via Hybrid Ontology Discovery

DevFeed: [ANCHOR: Schema-Agnostic Threat Knowledge Graph Construction via Hybrid Ontology Discovery](<https://devfeed.tech/articles/anchor-schema-agnostic-threat-knowledge-graph-construction-via-hybrid-ontology-discovery-133254.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.01208>)

Author: Seonwoo Kim, Jinwoo Kim, Daegyu Kang, Daeseong Kim, Insup Lee

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Threat Hunting & Intel](<https://devfeed.tech/topics/threat-hunting-intel.md>), [база знаний](<https://devfeed.tech/topics/tag-c51cc4bf76e5.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Structured-data](<https://devfeed.tech/topics/structured-data.md>), [schema design](<https://devfeed.tech/topics/schema-design.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>)

Tags: [adversary](<https://devfeed.tech/tags/adversary.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [anchor](<https://devfeed.tech/tags/anchor.md>), [apis](<https://devfeed.tech/tags/apis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attack](<https://devfeed.tech/tags/attack.md>), [based](<https://devfeed.tech/tags/based.md>), [bridges](<https://devfeed.tech/tags/bridges.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [combined](<https://devfeed.tech/tags/combined.md>), [compliance](<https://devfeed.tech/tags/compliance.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cyber](<https://devfeed.tech/tags/cyber.md>), [cyber-threat-intelligence](<https://devfeed.tech/tags/cyber-threat-intelligence.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [ontology](<https://devfeed.tech/tags/ontology.md>), [schema](<https://devfeed.tech/tags/schema.md>)

### AI overview

ANCHOR constructs cyber threat intelligence knowledge graphs across changing ontology schemas. It combines hybrid ontology discovery, which searches and navigates large schemas, with SHACL validation to enforce schema-compliant type assignments. The approach is intended to avoid manual pipeline reconfiguration and the scaling limits of inserting large ontologies into prompts. Experiments on UCO, STIX, and MALOnt reportedly show better ontology typing and schema compliance than existing baselines. With a local LLM, ANCHOR closely matches enterprise LLM typing performance, supporting privacy-preserving analysis of sensitive incident data. The supplied abstract does not include experiment details or quantify these gains.

### Source excerpt

arXiv:2606.01208v2 Announce Type: replace Abstract: Cyber threat intelligence (CTI) reports now serve as essential resources for capturing adversary tactics, techniques, and procedures observed in modern attack campaigns. While traditional CTI platforms reduce this intelligence to isolated indicators through fixed schemas such as STIX, ontology-based representations preserve the semantic relationships needed for structured threat analysis. However, existing approaches for ontology-aligned CTI extraction face three challenges: (i) schema-specific pipelines that require manual reconfiguration whenever the schema changes, (ii) prompt-based schema inclusion that fails to scale on large ontologies such as UCO, and (iii) reliance on enterprise LLM APIs that conflicts with privacy constraints when integrating sensitive internal incident data. In this paper, we present ANCHOR, a schema-agnostic CTI knowledge graph construction system that bridges LLMs and formal ontology schemas. At the core of ANCHOR is hybrid ontology discovery, a search-and-navigate mechanism that dynamically explores large-scale ontology schemas, combined with SHACL-based validation to enforce schema-compliant type assignments. Experimental results on the UCO, STIX, and MALOnt schemas show that ANCHOR outperforms existing baselines in ontology typing and schema compliance. In addition, ANCHOR with a local LLM closely matches enterprise LLM typing performance, enabling privacy-preserving CTI analysis with high fidelity.

## A Modular Framework for ESG Prediction through Domain-Specific Language Modeling and Graph Learning

DevFeed: [A Modular Framework for ESG Prediction through Domain-Specific Language Modeling and Graph Learning](<https://devfeed.tech/articles/a-modular-framework-for-esg-prediction-through-domain-specific-language-modeling-and-graph-learning-132284.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.16831>)

Author: Sofia Baiocco, Gianluca Bonifazi, Christopher Buratti, Michele Marchetti, Camilla Mazzoli, Federica Parlapiano, Giulia Quaglieri, Davide Traini, Domenico Ursino, Luca Virgili

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [2020](<https://devfeed.tech/tags/2020.md>), [2023](<https://devfeed.tech/tags/2023.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [corporate-sustainability](<https://devfeed.tech/tags/corporate-sustainability.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data-driven](<https://devfeed.tech/tags/data-driven.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [domain-specific-language](<https://devfeed.tech/tags/domain-specific-language.md>), [esg](<https://devfeed.tech/tags/esg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [framework](<https://devfeed.tech/tags/framework.md>), [governance](<https://devfeed.tech/tags/governance.md>), [graph](<https://devfeed.tech/tags/graph.md>), [investment](<https://devfeed.tech/tags/investment.md>), [learning](<https://devfeed.tech/tags/learning.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [modular](<https://devfeed.tech/tags/modular.md>), [network](<https://devfeed.tech/tags/network.md>), [performance](<https://devfeed.tech/tags/performance.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [regulatory-compliance](<https://devfeed.tech/tags/regulatory-compliance.md>)

### AI overview

ESGPred combines domain-specific language modeling with graph learning over relationships among companies to predict overall ESG ratings and Environmental, Social, and Governance components. It was evaluated on 5,266 sustainability reports from 2,134 publicly listed companies (2020-2023), using LSEG Data & Analytics ratings as ground truth. The authors report that adding graph-based relational learning improved prediction performance over purely text-based baselines. The supplied abstract does not provide performance metrics or further methodological detail.

### Source excerpt

arXiv:2611.16831v1 Announce Type: new Abstract: Environmental, Social and Governance (ESG) scores are increasingly used to evaluate corporate sustainability, supporting investment decisions, ensuring regulatory compliance and assessing risk. However, current ESG evaluations largely rely on proprietary methodologies that often produce inconsistent ratings. This motivates the development of data-driven prediction frameworks. In this paper, we present ESGPred, a modular framework for predicting ESG scores by combining domain-specific language modeling with graph-based learning over a network that models the relationships among the companies being evaluated. In addition to presenting the rationale behind ESGPred and detailing its ESG score prediction process, we show that ESGPred can effectively predict both overall ESG ratings and their individual Environmental, Social, and Governance components. We evaluated ESGPred using a dataset of 5,266 sustainability reports published by 2,134 publicly listed companies between 2020 and 2023. In this evaluation, we used ESG ratings provided by LSEG Data & Analytics as ground truth. Our experimental results demonstrated that integrating graph-based relational learning improves prediction performance over purely text-based baselines.

## Git2KG: Mining socio-technical relationships in GitHub repositories as temporal knowledge graphs

DevFeed: [Git2KG: Mining socio-technical relationships in GitHub repositories as temporal knowledge graphs](<https://devfeed.tech/articles/git2kg-mining-socio-technical-relationships-in-github-repositories-as-temporal-knowledge-graphs-131715.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15509>)

Author: Lennart Hessenauer, Lisi Qarkaxhija, Ingo Scholtes

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Graph Mining](<https://devfeed.tech/topics/graph-mining.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [GitHub](<https://devfeed.tech/topics/github.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [cs-se](<https://devfeed.tech/tags/cs-se.md>), [git](<https://devfeed.tech/tags/git.md>), [github](<https://devfeed.tech/tags/github.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [learning](<https://devfeed.tech/tags/learning.md>), [library](<https://devfeed.tech/tags/library.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [mining](<https://devfeed.tech/tags/mining.md>), [ownership](<https://devfeed.tech/tags/ownership.md>), [python](<https://devfeed.tech/tags/python.md>), [pytorch](<https://devfeed.tech/tags/pytorch.md>), [relationships](<https://devfeed.tech/tags/relationships.md>), [repositories](<https://devfeed.tech/tags/repositories.md>), [snapshots](<https://devfeed.tech/tags/snapshots.md>), [temporal](<https://devfeed.tech/tags/temporal.md>), [time](<https://devfeed.tech/tags/time.md>), [visualization](<https://devfeed.tech/tags/visualization.md>)

### AI overview

Git2KG is a Python library for building temporal knowledge graphs from GitHub repositories. It extracts co-editing relationships and code ownership from Git logs, then disambiguates developer identities to connect those graphs with management and communication networks from issue trackers. It divides development events into fixed-size, non-overlapping time windows to produce repository snapshots, and supports computing node features and labels for machine learning. Snapshots can be exported to PyTorch Geometric, PathPyG, and NetworkX for temporal analysis, visualization, and graph learning. The abstract presents this as a way to combine data sources and retain collaboration dynamics that time-aggregated network analyses can miss.

### Source excerpt

arXiv:2611.15509v1 Announce Type: new Abstract: The widespread use of Git and GitHub in open source software (OSS) projects has produced large volumes of data on collaborative software development. Existing approaches to mine those data often use graph models to (i) capture communication between developers in the issue tracker, or (ii) represent developer-developer co-authorship or developer-file code ownership networks from the editing history of code artifacts. Integrating these data in a single knowledge graph (KG) is complicated by the need to disambiguate authors and match entities from multiple sources. Moreover, most works using network analysis have taken a time-aggregated perspective that neglects temporal dynamics of collaborations. To address these issues, we present Git2KG, an extensible Python library that mines temporal knowledge graphs (TKGs) from GitHub repositories. Git2KG extracts fine-grained co-editing relations and code ownership from the Git log. It further disambiguates developer identities to align the resulting graphs with management and communication networks extracted from GitHub issue trackers. Git2KG supports temporal analysis by slicing development events into fixed-size, non-overlapping time windows, yielding a series of knowledge graph snapshots per repository. It further supports computing node features and labels for downstream machine learning tasks. Snapshots can then be exported to PyTorch Geometric, PathPyG, and NetworkX for temporal network analysis, visualization, and graph learning.

## Using Neo4j Change Data Capture to Orchestrate Agents

DevFeed: [Using Neo4j Change Data Capture to Orchestrate Agents](<https://devfeed.tech/articles/using-neo4j-change-data-capture-to-orchestrate-agents-130390.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/developer/change-data-capture-to-orchestrate-agents/>)

Author: julian busch

Published: 2026-11-12T09:47:29Z

Content type: article

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [agent orchestration](<https://devfeed.tech/topics/agent-orchestration.md>), [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Event-Streaming](<https://devfeed.tech/topics/event-streaming.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>), [Publish-subscribe pattern](<https://devfeed.tech/topics/pubsub.md>), [Python](<https://devfeed.tech/topics/python.md>)

Tags: [agent-orchestration](<https://devfeed.tech/tags/agent-orchestration.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agentic-workflow](<https://devfeed.tech/tags/agentic-workflow.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent-development](<https://devfeed.tech/tags/ai-agent-development.md>), [ai-and-context](<https://devfeed.tech/tags/ai-and-context.md>), [ai-and-machine-learning](<https://devfeed.tech/tags/ai-and-machine-learning.md>), [cdc](<https://devfeed.tech/tags/cdc.md>), [change-data-capture](<https://devfeed.tech/tags/change-data-capture.md>), [cloud-orchestration](<https://devfeed.tech/tags/cloud-orchestration.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [data-orchestration](<https://devfeed.tech/tags/data-orchestration.md>), [developer](<https://devfeed.tech/tags/developer.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [multi-agent-orchestration](<https://devfeed.tech/tags/multi-agent-orchestration.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>)

### AI overview

Neo4j CDC can trigger agent handoffs directly from committed graph changes: a poller reads ordered change records with `db.cdc.query`, filters for transitions such as a `Task` moving from `PENDING` to `ACTIVE`, then dispatches an agent whose write-back can trigger the next step. This keeps task state, events, governance, and audit data queryable together in Cypher and avoids reconciling a separate broker. The excerpt describes graph-based dead-letter records, cursor replay within the transaction log's readable window, single-poller leases, and idempotent dispatch. Trade-offs include a roughly 750 ms polling floor per hop and possible loss if downtime exceeds log retention; Kafka is suggested for durable retention, while Temporal can handle durable timers or saga coordination. CDC requires AuraDB Business Critical or a self-managed Enterprise or Infinigraph edition.

### Source excerpt

You've built a multi-agent orchestration pipeline. One agent finishes its work and writes a result. The next agent should pick that result up and run. Something has to notice the first agent finished and wake the second one. The usual... Read more ->

## Announcing the Relate by Neo4j Hackathon 2026: Build AI Agents on an Embedded Graph Database

DevFeed: [Announcing the Relate by Neo4j Hackathon 2026: Build AI Agents on an Embedded Graph Database](<https://devfeed.tech/articles/announcing-the-relate-by-neo4j-hackathon-2026-build-ai-agents-on-an-embedded-graph-database-129710.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/graph-database/announcing-the-relate-by-neo4j-hackathon-2026-build-ai-agents-on-an-embedded-graph-database/>)

Author: Kate Smith

Published: 2026-11-12T01:55:00Z

Content type: news

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [Hackathon](<https://devfeed.tech/topics/hackathon.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Neo4j](<https://devfeed.tech/topics/neo4j.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [build-ai-agents](<https://devfeed.tech/tags/build-ai-agents.md>), [coding-agents](<https://devfeed.tech/tags/coding-agents.md>), [connect](<https://devfeed.tech/tags/connect.md>), [connected-data](<https://devfeed.tech/tags/connected-data.md>), [database](<https://devfeed.tech/tags/database.md>), [developer](<https://devfeed.tech/tags/developer.md>), [embedded](<https://devfeed.tech/tags/embedded.md>), [event](<https://devfeed.tech/tags/event.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [hackathon](<https://devfeed.tech/tags/hackathon.md>), [launch](<https://devfeed.tech/tags/launch.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [nodes](<https://devfeed.tech/tags/nodes.md>), [online](<https://devfeed.tech/tags/online.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [relate](<https://devfeed.tech/tags/relate.md>)

### AI overview

Relate by Neo4j is an open-source embedded graph database for AI agents, offered as a library inside an application without a server or signup. Graphs can be kept in memory, a directory, or a single file; local relationship and vector lookups avoid network calls. The article highlights lightweight storage, structured JSON query results with capped rows, transactions for shared agent updates, and Rust, Python, CLI, and WebAssembly access. The month-long "Context, Connected" hackathon opens November 11 at 6 PM Pacific on Devpost and invites projects that use connected data to help agents solve concrete problems. Entries require a project description, public GitHub repository with setup instructions, and a 1-2 minute demo; working code or prompts used with Relate should be included. Judging scores six criteria equally, including usefulness, completeness, connected context, and agent capabilities. Three winners receive hardware valued at over $6,000 total; public voting separately determines a community favorite. The excerpt does not give the closing date or full rules.

### Source excerpt

Relate by Neo4j is a new open-source embedded database built for AI agents, launching at NODES 2026. To mark the launch, we're opening the Relate by Neo4j Hackathon, a month-long online event. The hackathon opens on November 11 at 6... Read more ->

## Meet Relate by Neo4j: An Embedded Database for AI Agents

DevFeed: [Meet Relate by Neo4j: An Embedded Database for AI Agents](<https://devfeed.tech/articles/meet-relate-by-neo4j-an-embedded-database-for-ai-agents-128024.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/news/meet-relate-by-neo4j-an-embedded-database-for-ai-agents/>)

Author: Kate Smith

Published: 2026-11-11T12:00:00Z

Content type: release

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [google-adk](<https://devfeed.tech/topics/google-adk.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-memory](<https://devfeed.tech/tags/agent-memory.md>), [agent-mode](<https://devfeed.tech/tags/agent-mode.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-and-data](<https://devfeed.tech/tags/ai-and-data.md>), [app](<https://devfeed.tech/tags/app.md>), [application](<https://devfeed.tech/tags/application.md>), [audit](<https://devfeed.tech/tags/audit.md>), [aura](<https://devfeed.tech/tags/aura.md>), [bolt](<https://devfeed.tech/tags/bolt.md>), [browser](<https://devfeed.tech/tags/browser.md>), [build](<https://devfeed.tech/tags/build.md>), [claude](<https://devfeed.tech/tags/claude.md>), [context](<https://devfeed.tech/tags/context.md>), [cypher](<https://devfeed.tech/tags/cypher.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [developer](<https://devfeed.tech/tags/developer.md>), [embedded](<https://devfeed.tech/tags/embedded.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [neo4j](<https://devfeed.tech/tags/neo4j.md>), [news](<https://devfeed.tech/tags/news.md>), [nodes](<https://devfeed.tech/tags/nodes.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [relate](<https://devfeed.tech/tags/relate.md>)

### AI overview

Relate by Neo4j is an open-source graph database embedded in an application, CLI sandbox, or browser via WASM, avoiding a separate server. It stores connected facts and supports Cypher queries that combine graph traversal with vector and full-text search. Agents can use its installable skills or MCP endpoint; agent mode returns JSON or Toon with row limits and structured, retryable errors. Data can be ephemeral in memory or persisted transactionally to a directory or single file, backed by Parquet, JSON, or Markdown. The article describes uses including agent memory, codebase context, dependency audits, and sandbox analysis, with configurable memory and traversal limits. Relate is presented for local, single-process work; when a project outgrows that, the same Cypher can be used with Neo4j, with subgraphs exchanged with Aura and connections available over Bolt or HTTP.

### Source excerpt

Your agent works with a lot of different kinds of data: customer records, documents and tickets, plans that span sessions, records of what it did and who approved it. To be quick and reliable, an agent needs context it can... Read more ->

## PuppyGraph raises $10M to let AI agents query enterprise data as a graph

DevFeed: [PuppyGraph raises $10M to let AI agents query enterprise data as a graph](<https://devfeed.tech/articles/puppygraph-raises-10m-to-let-ai-agents-query-enterprise-data-as-a-graph-126618.md>)

Original publisher: [Read original article](<https://siliconangle.com/2026/11/10/puppygraph-raises-10m-to-let-ai-agents-query-enterprise-data-as-a-graph/>)

Author: Duncan Riley

Published: 2026-11-10T14:00:16Z

Content type: news

Language: en

Sources: [SiliconANGLE](<https://devfeed.tech/sources/siliconangle.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [data-governance](<https://devfeed.tech/topics/data-governance.md>)

Tags: [advanced-micro-devices](<https://devfeed.tech/tags/advanced-micro-devices.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [amy-yin](<https://devfeed.tech/tags/amy-yin.md>), [annual-recurring-revenue](<https://devfeed.tech/tags/annual-recurring-revenue.md>), [anthropic](<https://devfeed.tech/tags/anthropic.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [big-data](<https://devfeed.tech/tags/big-data.md>), [claude](<https://devfeed.tech/tags/claude.md>), [coinbase](<https://devfeed.tech/tags/coinbase.md>), [coinbase-global](<https://devfeed.tech/tags/coinbase-global.md>), [context-window](<https://devfeed.tech/tags/context-window.md>), [databricks](<https://devfeed.tech/tags/databricks.md>), [datadog](<https://devfeed.tech/tags/datadog.md>), [defy-vc](<https://devfeed.tech/tags/defy-vc.md>), [docker](<https://devfeed.tech/tags/docker.md>), [enterprise-data](<https://devfeed.tech/tags/enterprise-data.md>), [funding](<https://devfeed.tech/tags/funding.md>), [google](<https://devfeed.tech/tags/google.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [graph-query-engine](<https://devfeed.tech/tags/graph-query-engine.md>), [model-context-protocol](<https://devfeed.tech/tags/model-context-protocol.md>), [news](<https://devfeed.tech/tags/news.md>), [palo-alto-networks](<https://devfeed.tech/tags/palo-alto-networks.md>), [particle-future](<https://devfeed.tech/tags/particle-future.md>), [puppygraph](<https://devfeed.tech/tags/puppygraph.md>), [row-level-permissions](<https://devfeed.tech/tags/row-level-permissions.md>), [series-a](<https://devfeed.tech/tags/series-a.md>), [snowflake](<https://devfeed.tech/tags/snowflake.md>), [the-latest](<https://devfeed.tech/tags/the-latest.md>), [trend-micro](<https://devfeed.tech/tags/trend-micro.md>), [weimo-liu](<https://devfeed.tech/tags/weimo-liu.md>), [xinyu-liu](<https://devfeed.tech/tags/xinyu-liu.md>)

### AI overview

PuppyGraph lets AI agents query enterprise data as a graph while it remains in existing warehouses and lakehouses, avoiding a separate graph database and data migration. For version 1.0, an AI-assisted tool drafts a graph schema from existing tables for teams to review; users can then ask questions in plain English through PuppyGraph's agent or their existing AI tools via Model Context Protocol. Agents cannot query relationships absent from the approved schema: those queries are rejected with actionable errors. For Snowflake and Databricks, the company says it can use short-lived, user-linked credentials, and row-level permissions are checked at each traversal hop. PuppyGraph claims agents can query across 3,000 tables with results in under a second; the article says deeper queries can stall in scaled projects and gives no independent performance evidence. The company raised $10 million in a Series A led by Particle Future and defy.vc, bringing reported investment to $15 million.

### Source excerpt

Graph query engine startup PuppyGraph said today it has raised $10 million in new funding to build out its enterprise go-to-market operation. The round follows the general release of version 1.0 of its software. PuppyGraph provides a query engine that lets companies treat data already sitting in their warehouses and lakehouses as a single graph, without [...] The post PuppyGraph raises $10M to let AI agents query enterprise data as a graph appeared first on SiliconANGLE.

## Build a Knowledge Layer: Connect Your Data Sources with a Composite Database

DevFeed: [Build a Knowledge Layer: Connect Your Data Sources with a Composite Database](<https://devfeed.tech/articles/build-a-knowledge-layer-connect-your-data-sources-with-a-composite-database-127286.md>)

Original publisher: [Read original article](<https://neo4j.com/blog/graph-database/build-a-knowledge-layer-connect-your-data-sources-with-a-composite-database/>)

Author: corydon baylor

Published: 2026-11-10T14:00:00Z

Content type: article

Language: en

Sources: [Neo4j](<https://devfeed.tech/sources/graph-database-technology-neo4j-blog.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [Neo4j](<https://devfeed.tech/topics/neo4j.md>), [AI Integration Strategies](<https://devfeed.tech/topics/ai-integration-strategies.md>), [knowledge-engineering](<https://devfeed.tech/topics/knowledge-engineering.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [data](<https://devfeed.tech/tags/data.md>), [database](<https://devfeed.tech/tags/database.md>), [governance](<https://devfeed.tech/tags/governance.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [graph-databases](<https://devfeed.tech/tags/graph-databases.md>), [knowledge-graph](<https://devfeed.tech/tags/knowledge-graph.md>), [knowledge-layer](<https://devfeed.tech/tags/knowledge-layer.md>), [link](<https://devfeed.tech/tags/link.md>), [links](<https://devfeed.tech/tags/links.md>)

### AI overview

A composite database gives an AI agent one connection to multiple graphs while routing each query to a named constituent with a `USE` clause. In the Nordtell Bank demo, it brings together a virtual graph over banking systems, a business-plan document graph, lending policy, an ontology, and decision history; the graphs remain separately owned, governed, and stored without copying their source records. Cross-graph relationships cannot be written into the source constituents, so a separate writable shadow database stores links between them. Its lightweight `:Shadow` nodes keep source graph and ID references plus identity properties, leaving full records and source graphs unchanged.

### Source excerpt

In this series 1. Give Your AI Agents the Shared Context to Succeed 2. Map Your Data with an Ontology 3. Turn Your Existing Data into Context 4. Connect Your Data Sources with a Composite Database 5. Ground Decisions in... Read more ->

## PuppyGraph adds AI schema builder and MCP support to help ease enterprise agent adoption

DevFeed: [PuppyGraph adds AI schema builder and MCP support to help ease enterprise agent adoption](<https://devfeed.tech/articles/puppygraph-adds-ai-schema-builder-and-mcp-support-to-help-ease-enterprise-agent-adoption-126610.md>)

Original publisher: [Read original article](<https://www.infoworld.com/article/4246810/puppygraph-adds-ai-schema-builder-and-mcp-support-to-help-ease-enterprise-agent-adoption.html>)

Author: Anirban Ghoshal

Published: 2026-11-10T14:00:00Z

Content type: news

Language: en

Sources: [InfoWorld](<https://devfeed.tech/sources/infoworld.md>)

Topics: [graph-database](<https://devfeed.tech/topics/graph-database.md>), [schema design](<https://devfeed.tech/topics/schema-design.md>), [AI Integration Strategies](<https://devfeed.tech/topics/ai-integration-strategies.md>), [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>), [SQL](<https://devfeed.tech/topics/sql.md>), [Apache Iceberg](<https://devfeed.tech/topics/apache-iceberg.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-adoption](<https://devfeed.tech/tags/agent-adoption.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-assisted](<https://devfeed.tech/tags/ai-assisted.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [artificial-intelligence-data-management](<https://devfeed.tech/tags/artificial-intelligence-data-management.md>), [automatically](<https://devfeed.tech/tags/automatically.md>), [builder](<https://devfeed.tech/tags/builder.md>), [data-management](<https://devfeed.tech/tags/data-management.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [engine](<https://devfeed.tech/tags/engine.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [enterprise-data](<https://devfeed.tech/tags/enterprise-data.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-database](<https://devfeed.tech/tags/graph-database.md>), [graph-query-engine](<https://devfeed.tech/tags/graph-query-engine.md>), [integrations](<https://devfeed.tech/tags/integrations.md>), [language-en](<https://devfeed.tech/tags/language-en.md>), [large-datasets](<https://devfeed.tech/tags/large-datasets.md>), [latency](<https://devfeed.tech/tags/latency.md>), [mcp](<https://devfeed.tech/tags/mcp.md>), [puppygraph](<https://devfeed.tech/tags/puppygraph.md>), [schema](<https://devfeed.tech/tags/schema.md>), [storytype-news](<https://devfeed.tech/tags/storytype-news.md>)

### AI overview

PuppyGraph 1.0 adds an AI-assisted schema builder and MCP integrations to expose enterprise data through a distributed graph query engine. The builder maps existing tables into graph entities, relationships, and properties for developers to review; agents can use that schema instead of discovering tables and composing joins dynamically. The engine validates agent-generated queries against defined relationships and returns correction feedback, while splitting complex graph queries across compute nodes. PuppyGraph queries relational databases, warehouses, and lakehouses without copying data into a separate graph database, and also supports SQL. Trade-offs remain: developers must design and govern the graph model, results depend on source schema and data quality, and graph workloads can raise compute costs on underlying platforms. Analysts describe it as suited to analytical queries rather than low-latency graph writes or frequent transactional updates, and advise considering the vendor's maturity and support capacity.

### Source excerpt

PuppyGraph on Tuesday said it was adding an AI-assisted graph schema builder and MCP integrations to PuppyGraph 1.0, the new version of its distributed graph query engine for enterprise data. The update is designed to help developers reduce the complexity, latency, and costs associated with letting AI agents query interconnected data across thousands of database tables and multiple platforms. The AI-assisted schema builder automatically maps existing tables into graph entities, relationships, and properties, allowing developers to review and approve the resulting schema rather than manually defining how disparate datasets connect, the Santa Clara-headquartered startup said in a statement. These schemas can be used by agents deployed to query enterprise data, giving them a predefined map of how information across different tables and systems is connected, rather than requiring them to identify relevant tables and construct complex SQL joins dynamically, in turn simplifying query generation and reducing errors and retries, it added. To improve query accuracy, PuppyGraph's query engine also validates agent-generated queries against the graph schema, rejecting undefined relationships and returning feedback that agents can use to correct errors. Further, the execution engine splits complex graph queries into smaller operations that run simultaneously across multiple compute nodes, rather than sequentially on a single machine, helping accelerate queries that traverse multiple relationships across large datasets, the company said. These additions build on PuppyGraph's existing graph query engine, released in 2024, that lets enterprises query relational databases, data warehouses and lakehouses as a unified graph without moving or duplicating data into a separate graph database. The engine maps existing tables into a native Labeled Property Graph (LPG) model, representing data entities as nodes, their relationships as edges, and their attributes as properties, before execut

## Lightfoot: Graph Retrieval-Augmented Generation with Exact, Model-Free Document Deletion

DevFeed: [Lightfoot: Graph Retrieval-Augmented Generation with Exact, Model-Free Document Deletion](<https://devfeed.tech/articles/lightfoot-graph-retrieval-augmented-generation-with-exact-model-free-document-deletion-126055.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11010>)

Author: Uday Allu

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [free](<https://devfeed.tech/tags/free.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphrag](<https://devfeed.tech/tags/graphrag.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [language-model](<https://devfeed.tech/tags/language-model.md>), [model](<https://devfeed.tech/tags/model.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [retrieval-augmented-generation](<https://devfeed.tech/tags/retrieval-augmented-generation.md>)

### AI overview

Lightfoot makes each graph element a deterministic function of passage extractions with chunk-level provenance. It uses one language-model call per passage during indexing, none for retrieval, and deletes documents through database operations without model calls. After deleting 10% of the 11,402-passage MuSiQue corpus, the resulting graph matched a fresh index of the survivors. Across three datasets, Lightfoot's index cost was 26-31% below HippoRAG 2 and 3-6 times below LightRAG and fast-graphrag. Results versus HippoRAG 2 varied: Lightfoot improved MuSiQue retrieval and HotpotQA exact match, but scored worse on 2WikiMultiHopQA retrieval and F1. In the reported deletion comparison, LightRAG required 2,187 model calls and 3.7 hours; fast-graphrag had no deletion path.

### Source excerpt

arXiv:2611.11010v1 Announce Type: new Abstract: Graph-based retrieval-augmented generation (GraphRAG) improves multi-hop question answering, but deployed systems face two costs that research comparisons rarely measure: building the graph, and removing documents from it. We present Lightfoot, a GraphRAG system in which every entity, link, fact and synonym edge is a deterministic function of per-passage extractions carrying chunk-level provenance. Indexing makes one language-model call per passage, retrieval makes none, and deleting a document is a database operation with no model calls. On the full 11,402-passage MuSiQue corpus we verify that, after deleting 10% of the documents, the graph is identical to a fresh index of the surviving documents. We compare Lightfoot with HippoRAG 2, LightRAG and fast-graphrag under identical extraction, answer and embedding models on MuSiQue, 2WikiMultiHopQA and HotpotQA. Lightfoot builds the cheapest index on all three datasets, 26-31% below HippoRAG 2 and 3-6x below LightRAG and fast-graphrag. Against HippoRAG 2 it is significantly better on MuSiQue retrieval (+2.8 points recall@5 and +4.3 recall@10 on a held-out split) and on HotpotQA answers (+7.7 points exact match), and significantly worse on 2WikiMultiHopQA (-3.9 recall@2, -8.4 F1). Deleting the same documents took LightRAG 2,187 model calls and 3.7 hours; fast-graphrag has no deletion path. Code and per-question results: https://github.com/udayallu-ml/Lightfoot-GraphRAG

## Logical Scalability in Big Data Architectures: Impact of Data Modeling on the Database Layer

DevFeed: [Logical Scalability in Big Data Architectures: Impact of Data Modeling on the Database Layer](<https://devfeed.tech/articles/logical-scalability-in-big-data-architectures-impact-of-data-modeling-on-the-database-layer-124231.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.09346>)

Author: Rosario Napoli, Mark Adrian Gambito, Antonio Celesti, Maria Fazio

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [big-data](<https://devfeed.tech/topics/big-data.md>), [data-modeling](<https://devfeed.tech/topics/data-modeling.md>), [Database](<https://devfeed.tech/topics/database.md>), [database-optimization](<https://devfeed.tech/topics/database-optimization.md>), [database-scalability](<https://devfeed.tech/topics/database-scalability.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [architectures](<https://devfeed.tech/tags/architectures.md>), [big-data](<https://devfeed.tech/tags/big-data.md>), [bottlenecks](<https://devfeed.tech/tags/bottlenecks.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [data-modeling](<https://devfeed.tech/tags/data-modeling.md>), [database](<https://devfeed.tech/tags/database.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [distributed-coordination](<https://devfeed.tech/tags/distributed-coordination.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [layer](<https://devfeed.tech/tags/layer.md>), [logical](<https://devfeed.tech/tags/logical.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machines](<https://devfeed.tech/tags/machines.md>), [misalignment](<https://devfeed.tech/tags/misalignment.md>), [model](<https://devfeed.tech/tags/model.md>), [patterns](<https://devfeed.tech/tags/patterns.md>), [performance](<https://devfeed.tech/tags/performance.md>), [performance-analysis](<https://devfeed.tech/tags/performance-analysis.md>), [scalability](<https://devfeed.tech/tags/scalability.md>)

### AI overview

The abstract reports that choosing a database model suited to the data and query patterns is more important for performance than adding machines alone. It compares Document, Graph, and Multi-Model databases across workloads, queries, and dataset scales, and finds that model misalignment can keep performance bottlenecked despite more computational resources. Scaling out an inadequate model can perform no better than, or worse than, a single machine because distributed coordination adds overhead. The supplied text does not provide detailed measurements or per-paradigm results.

### Source excerpt

arXiv:2611.09346v1 Announce Type: new Abstract: In modern Big Data architectures, scalability is often addressed through infrastructural expansion, involving vertical or horizontal scaling to manage growing data volumes. However, this hardware-centric perspective overlooks the logical scalability of the storage layer. A central challenge lies in how data modeling choices affect the storage layer of big data architectures. Specifically, when the data model is misaligned with the underlying query patterns, performance bottlenecks emerge and persist regardless of the available computational resources. This paper investigates the concept of logical scalability by conducting a comparative performance analysis of Document, Graph and Multi-Model database paradigms under varying workloads, queries and dataset scales. Our results demonstrate that performance degradation caused by model misalignment cannot be mitigated by additional computational resources alone. Increasing the number of machines while retaining a structurally inadequate data model yields performance equivalent to or worse than a single-machine configuration, as distributed coordination overhead compounds the inefficiencies of the underlying logical model. We demonstrate that efficiency is maximized when the logical structure of the database aligns with the inherent nature of the data and the intended analysis scope, a condition that proves to be more decisive than any infrastructural scaling strategy.

## Improving Contextual Retrieval for Long Documents using Semantic Chunking and Hybrid Retrieval Strategies

DevFeed: [Improving Contextual Retrieval for Long Documents using Semantic Chunking and Hybrid Retrieval Strategies](<https://devfeed.tech/articles/improving-contextual-retrieval-for-long-documents-using-semantic-chunking-and-hybrid-retrieval-strategies-123262.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.08498>)

Author: Sakshi Garg, William B. Andreopoulos

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [information retrieval](<https://devfeed.tech/topics/information-retrieval.md>), [AI-driven information retrieval](<https://devfeed.tech/topics/ai-driven-information-retrieval.md>), [Enhancing AI model performance](<https://devfeed.tech/topics/enhancing-ai-model-performance.md>), [graph-database](<https://devfeed.tech/topics/graph-database.md>)

Tags: [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [hybrid-rag](<https://devfeed.tech/tags/hybrid-rag.md>), [information-retrieval](<https://devfeed.tech/tags/information-retrieval.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [retrieval-augmented-generation](<https://devfeed.tech/tags/retrieval-augmented-generation.md>), [retrieval-augmented-generation-rag](<https://devfeed.tech/tags/retrieval-augmented-generation-rag.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [system](<https://devfeed.tech/tags/system.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-index](<https://devfeed.tech/tags/vector-index.md>)

### AI overview

The proposed hybrid RAG framework combines a dynamic knowledge graph, which captures explicit entity relationships, with a dense vector index for broader semantic retrieval. It uses transformer summarization and semantic chunking to retain context, then prioritizes graph traversal during inference and falls back to vector retrieval when needed. On the MultiHop-RAG dataset, the authors report higher Exact Match scores and retrieval accuracy than standalone graph-based and vector-based baselines. The supplied text gives no numerical results or implementation details.

### Source excerpt

arXiv:2611.08498v1 Announce Type: cross Abstract: The vast amount of information available in lengthy, distributed documents makes finding relevant answers difficult, especially when the answer requires connecting evidence from multiple sources. Standard Retrieval-Augmented Generation (RAG) systems often struggle with this type of "multi-hop" reasoning and frequently face issues with context fragmentation. In this paper, we propose a hybrid RAG framework that integrates the structured reasoning of knowledge graphs with the broad semantic coverage of dense vector retrieval. Our approach employs a multi-stage pipeline using transformer-based summarization and semantic chunking to improve context retention. We construct a dynamic knowledge graph to capture explicit relationships between entities while simultaneously maintaining a dense vector index. During inference, the system uses a hierarchical mechanism that prioritizes graph traversal for precision and falls back to vector retrieval when necessary. We evaluated our framework on the MultiHop-RAG dataset. The results show that this hybrid approach outperforms standalone vector and graph-based baselines, achieving higher Exact Match scores and improved retrieval accuracy for complex queries. This confirms that merging structured reasoning with standard vector retrieval creates a more robust system for handling complex knowledge-intensive questions.

[Next page](<https://devfeed.tech/topics/graph-database.md?cursor=WyIyMDI2LTExLTA5VDA1OjAwOjAwKzAwOjAwIiwgIjJhNTA5NzM3LTIxNGEtNDRlZi05ZDBjLTYzYWRjOWU1NGE5MiJd>)