Reproduce “PG-Schema: Schemas for Property Graphs” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin and 13 more

PG-Schema is proposed as a comprehensive formalism for specifying property graph schemas, addressing the limited and fragmented schema support in current graph database systems and the ongoing GQL standardization. It offers a unified approach to define data structure and integrity constraints, intended to inform the development of GQL's future Data Definition Language.

Key insights

  • PG-Schema separates type definitions (PG-Types), which are locally verifiable, from integrity constraints (PG-Keys), which contributes to tractable validation processes.
  • It supports rich type hierarchies, multi-inheritance, and abstract types within PG-Types, enhancing modularity and expressiveness in schema definitions.
  • The formalism introduces concepts like "open" versus "closed" types for extensibility control and "STRICT" versus "LOOSE" graph types for flexible validation modes.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.