Sketch-Oriented Databases

2026-03-07

AI Summary

This work addresses the challenge of uniformly modeling heterogeneous graph database paradigms—such as RDF and property graphs—while supporting path queries and type consistency verification. The authors propose a category-theoretic framework based on finite-limit sketches, encoding each database paradigm as a “stuttering sketch” whose instances are interpreted as set-valued models. A localizer is introduced to enable lazy inference over paths, simplifying relational definitions and facilitating modular composition and extensible modeling. The framework is shown to preserve key structural properties: finite coproducts of models form pointwise colimits, ensuring composability. By unifying core features—including labels, attributes, types, and paths—within a single formalism, the approach guarantees type safety while enhancing query efficiency and model interoperability.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Description Logics
• Data Mining & Knowledge Management: Linked Open Data, Knowledge Graphs & KB Completion

Application Category

• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies
• Web Mining and Content Analysis: Models for Web evolution

Abstract

This paper introduces sketch-oriented databases, a categorical framework that encodes database paradigms as finite-limit sketches and individual databases and schemas as set-valued models. It illustrates the formalism through graph-oriented paradigms such as quivers, RDF triplestores and property graphs. It also shows how common graph features such as labels, attributes, typing, and paths, are uniformly captured by sketch constructions. Because paths play an important role in queries, we propose inference rules formalized via localizers to compute useful paths lazily; such localizers are also useful for tasks like database type conformance. Finally, the paper introduces stuttering sketches, whose aim is to facilitate modular composition and scalable model growth: stuttering sketches are finite-limit sketches in which relations are specified by a single limit instead of two nested limits, and the paper proves that finite unions of models of a stuttering sketch are pointwise colimits.

Problem

• sketch-oriented databases
• finite-limit sketches
• graph-oriented paradigms
• path computation
• modular composition

Innovation

• sketch-oriented databases
• finite-limit sketches
• localizers
• stuttering sketches
• graph databases