Efficient adjacency matrix representation

The data structure divides RDF adjacency matrices into partitions with Morton coding for efficient storage and indexing, addressing memory challenges in RDF graph databases and enhancing performance and cost efficiency.

JP2026104827APending Publication Date: 2026-06-25DASSAULT SYSTEMES SA
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
DASSAULT SYSTEMES SA
Filing Date
2025-12-08
Publication Date
2026-06-25

Smart Images

  • Figure 2026104827000001_ABST
    Figure 2026104827000001_ABST
Patent Text Reader

Abstract

This provides an improved data structure for representing adjacency matrices associated with predicates in a set of quads in an RDF (Resource Description Framework) graph database, a method for updating the data structure, and a program for doing so. [Solution] The data structure representing the adjacency matrix is ​​divided into a grid of rectangular partitions, the rectangular partitions having the same dimensions 100, the adjacency matrix includes a set of adjacency submatrices, each adjacency submatrice corresponds to each partition of the adjacency matrix, and each adjacency submatrice is identified by its respective position in the grid 110.
Need to check novelty before this filing date? Find Prior Art