Patch release 3.2.52 out with fixes in query engine and date conversion more at https://github.com/orientechnologies/orientdb/releases/tag/3.2.52

#nosql #graphdb #database #dbms #GraphDBMS

Release 3.2.52 · orientechnologies/orientdb

This patch release contain an additional fix in query engine "order by" logic with nested properties, and a fix in dates without time. Changes Core Truncate asDate timestamps with 24-hour clock, t...

GitHub

AionDB: PostgreSQL-compatible SQL, graph, and vector database in Rust

AionDB는 Rust로 개발된 PostgreSQL 호환 SQL, 그래프, 벡터 데이터베이스로, 관계형 데이터, 그래프 관계, 벡터 검색을 하나의 엔진에서 지원합니다. pgwire 프로토콜과 여러 검증된 ORM을 통해 기존 PostgreSQL 생태계 도구와 호환되며, SQL과 Cypher 스타일 쿼리를 동시에 사용할 수 있습니다. 성능 면에서 SurrealDB 대비 경쟁력 있는 결과를 보이나, PostgreSQL 대체나 완전한 분산 클러스터 기능은 아직 지원하지 않습니다. 현재 알파 버전으로, 실제 적용 시 기능별 검증이 필요합니다.

https://aiondb.xyz/

#rust #database #postgresql #vectorsearch #graphdb

Home - aiondb

Let me use this time to write down what I'm building. Not what's in my git repos. What's in my head.

The system is distributed. And distribution is optional. Each node has their own state, their own runtime, their own persistence. All one thing.

Each node in the system is a content-addressed Merkle Tree. Not SHA. Coincidence. A spectral coincidence hash. 5 dimensions. (1 more than spacetime.)

A spectral coincidence hash describes the structure of the data. You can do math on that. Spectral graph analysis. The world becomes navigatable. Because everything has an address.

Each computation. Each inference. Each failure. Each partial success. Each time information was lost. All of it enters the graph. All of it local. All of it distributed if needed. (For the BEAM engineers: it's an mnesia backend.)

A system that doesn't only know what it knows and what it doesn't. A system that knows how it got there. And AI that lives inside that knowledge.

That's what I'm building.

#SovereignTechFellowship grant application open. Release on the horizon. Wish me luck!

#OpenSource #EUTech #AI #Erlang #Fortan #Rust #GraphDB

Sau (@cachesaur)

LLM이 복잡한 다단계 추론에서 관계형 DB보다 그래프 DB에 더 잘 맞는 이유를 설명한다. 벡터 검색은 의미적 유사성에는 강하지만, 스키마 같은 구조적 정보에는 약해 관계형 스키마에서 LLM 성능이 떨어진다는 점을 지적한다.

https://x.com/cachesaur/status/2046857825104900184

#llm #graphdb #relationaldb #vectorsearch #reasoning

Sau (@cachesaur) on X

@_avichawla This is precisely why LLMs are more fluent in graph DBs as compared to relational DBs for complex multi-hop reasoning. Theoretically why LLMs suck at relational schemas, is because vector search is meant for semantic not for structural schemas

X (formerly Twitter)
OrientDB work in progress update 2026 Q1 |

Knowledge graphs are useful representations for knowledge bases, #pkm, #AImemory systems, #GraphRAG, intelligent tutoring systems, etc., and usually implemented in graph databases. LadybugDB, a fork of the discontinued Kuzu, is a lightweight embedded (like SQLite) graph database: https://github.com/LadybugDB/ladybug
Sample applications in development: https://github.com/inventivepotter/dotmd & https://github.com/tejzpr/Smriti-MCP
See also Grafeo: https://github.com/GrafeoDB/grafeo
#AIEd #AIEngineering #KnowledgeGraph #GraphDB #graphdatabase
GitHub - LadybugDB/ladybug: LadybugDB a graph database

LadybugDB a graph database. Contribute to LadybugDB/ladybug development by creating an account on GitHub.

GitHub
New patch release 3.2.51 is out with fixes in the query engine, release notes: https://github.com/orientechnologies/orientdb/releases/tag/3.2.51
#nosql #OrientDB #graphdb #database #dbms #graphDBMS
Release 3.2.51 · orientechnologies/orientdb

This patch release contain a fix in query engine "order by" logic with nested properties, a fix backup scheduler configuration update and updates of dependencies. Changes Core Fix order by for nes...

GitHub

Also if you are into #rdf and #knowledgegraph you have heard of tinker pop gremlin 👹 then the following pipeline might remind you some good souvenir:

´´´
(let ((g (make-graph gremlin-n gremlin-e 10 12345)))
(display "Graph: ")
(display gremlin-n)
(display " vertices, ")
(display gremlin-e)
(display " edges/vertex, 10 groups")
(newline)
(let ((tri (time
(traverse g
(V)
(as a)
(out)
(as b)
(where (same-group? g a b))
(out)
(as c)
(where (same-group? g a c))
(where (edge? g c a))
(count)))))
(display tri)
(display " triangles")
(newline)))
´´´

ref: https://github.com/amirouche/seed/blob/seed3/src/src/seed3/benchmarks/gremlin-pipeline.seed3

#scheme #graphdb

New patch release out with minor fixes in backup scheduling and view refresh, release notes https://github.com/orientechnologies/orientdb/releases/tag/3.2.50

#nosql #OrientDB #graphdb #database #dbms #graphDBMS

Release 3.2.50 · orientechnologies/orientdb

Small patch release with a fix in backup failure handling and view refresh scheduling, together with deps update Changes Core Dependency updates Minor fix view update execution, avoiding to run wh...

GitHub
ArcadeDB 26.2.1 is out! Biggest highlights: - @Neo4j Bolt protocol support - use standard Neo4j drivers - Full @openCypher TCK compliance - New SQL parser - SQL Triggers (SQL, JS, Java) - Scheduled Backups 200+ issues closed github.com/ArcadeData/a... #graphdb #multimodel

Release 26.2.1 · ArcadeData/ar...