Views: a hardware-friendly graph database model for storing semantic information
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912707438968832 |
|---|---|
| author | Yang, Yanjun Wheeldon, Adrian Pan, Yihan Prodromakis, Themis Serb, Alex |
| author_facet | Yang, Yanjun Wheeldon, Adrian Pan, Yihan Prodromakis, Themis Serb, Alex |
| contents | The graph database (GDB) is an increasingly common storage model for data involving relationships between entries. Beyond its widespread usage in database industries, the advantages of GDBs indicate a strong potential in constructing symbolic artificial intelligences (AIs) and retrieval-augmented generation (RAG), where knowledge of data inter-relationships takes a critical role in implementation. However, current GDB models are not optimised for hardware acceleration, leading to bottlenecks in storage capacity and computational efficiency. In this paper, we propose a hardware-friendly GDB model, called Views. We show its data structure and organisation tailored for efficient storage and retrieval of graph data and demonstrate its functional equivalence and storage performance advantage compared to represent traditional graph representations. We further demonstrate its symbolic processing abilities in semantic reasoning and cognitive modelling with practical examples and provide a short perspective on future developments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18123 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Views: a hardware-friendly graph database model for storing semantic information Yang, Yanjun Wheeldon, Adrian Pan, Yihan Prodromakis, Themis Serb, Alex Databases Hardware Architecture Distributed, Parallel, and Cluster Computing Symbolic Computation The graph database (GDB) is an increasingly common storage model for data involving relationships between entries. Beyond its widespread usage in database industries, the advantages of GDBs indicate a strong potential in constructing symbolic artificial intelligences (AIs) and retrieval-augmented generation (RAG), where knowledge of data inter-relationships takes a critical role in implementation. However, current GDB models are not optimised for hardware acceleration, leading to bottlenecks in storage capacity and computational efficiency. In this paper, we propose a hardware-friendly GDB model, called Views. We show its data structure and organisation tailored for efficient storage and retrieval of graph data and demonstrate its functional equivalence and storage performance advantage compared to represent traditional graph representations. We further demonstrate its symbolic processing abilities in semantic reasoning and cognitive modelling with practical examples and provide a short perspective on future developments. |
| title | Views: a hardware-friendly graph database model for storing semantic information |
| topic | Databases Hardware Architecture Distributed, Parallel, and Cluster Computing Symbolic Computation |
| url | https://arxiv.org/abs/2508.18123 |