Adaptive Low-level Storage of Very Large Knowledge Graphs
Jacopo Urbani, Ceriel J. H. Jacobs
Abstract
The increasing availability and usage of Knowledge Graphs (KGs) on the Web calls for scalable and general-purpose solutions to store this type of data structures. We propose Trident, a novel storage architecture for very large KGs on centralized systems. Trident uses several interlinked data structures to provide fast access to nodes and edges, with the physical storage changing depending on the topology of the graph to reduce the memory footprint. In contrast to single architectures designed for single tasks, our approach offers an interface with few low-level and general-purpose primitives that can be used to implement tasks like SPARQL query answering, reasoning, or graph analytics. Our experiments show that Trident can handle graphs with 10 11 edges using inexpensive hardware, delivering competitive performance on multiple workloads.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itRelated papers
- A Universal Question-Answering Platform for Knowledge GraphsReham Omar, Ishika Dhall, Panos Kalnis, Essam MansourSIGMOD 2023 · 48 citations
- PYTHIA: Universal Question Answering over Knowledge GraphsSergios-Anestis Kefalidis, Konstantinos Plas, Manolis KoubarakisKDD 2026 · 1 citation
- LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph RetrievalHe Cheng, Yifu Wu, Saksham Khatwani, Maya Kruse et al.ACL 2026
- RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph StorageHaoxuan Xie, Junfeng Liu, Siqiang Luo, Kai WangSIGMOD 2026 · 1 citation
- APEX2: Adaptive and Extreme Summarization for Personalized Knowledge GraphsZihao Li, Dongqi Fu, Mengting Ai, Jingrui HeKDD 2025 · 1 citation
