Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.07268 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915842574254080 |
|---|---|
| author | Duval, Dominique Echahed, Rachid |
| author_facet | Duval, Dominique Echahed, Rachid |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07268 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sketch-Oriented Databases Duval, Dominique Echahed, Rachid Logic in Computer Science Databases F.3; I.1; H.2 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. |
| title | Sketch-Oriented Databases |
| topic | Logic in Computer Science Databases F.3; I.1; H.2 |
| url | https://arxiv.org/abs/2603.07268 |