Implementing Hypergraph Databases with Fast Relationship Linking and Traversal Using ILE
Vitit Kantabutra · 2022
This paper suggests a new method of implementing a hypergraph database system with more robust, very efficient relationship linking. This implementation method is needed because the hypergraph is a very useful data model, yet the extant hypergraph database implementations do not appear to link relationships robustly or quickly compared to ordinary graph databases. Specifically, this paper shows how to implement a hypergraph database so that each hyperedge representing a relationship that links a set of nodes and/or other hyperedges, has direct, ultrafast, bidirectional, pointer-based connections with such nodes and/or other hyperedges. This paper's method of implementing hypergraph databases involves using and extending the author's previously published ILE, or Intentionally Linked Entities, database system.