Ubergraphs: A Definition of a Recursive Hypergraph Structure
Cliff Joslyn, Kathleen Nowak
TL;DR
This paper introduces ubergraphs, a recursive hypergraph data structure, to formalize complex relationships within database systems, aiming to enhance the theoretical foundation of such structures.
Contribution
It provides a formal definition of ubergraphs, a novel recursive hypergraph structure, expanding the theoretical understanding of hypergraph-based databases.
Findings
Formal definition of ubergraphs
Potential applications in database modeling
Foundation for future hypergraph research
Abstract
Partly in service of exploring the formal basis for Georgetown University's AvesTerra database structure, we formalize a recursive hypergraph data structure, which we call an ubergraph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Constraint Satisfaction and Optimization