idiolect

Mutual intelligibility for schema idiolects.

idiolect-dev/idiolect

Mutual intelligibility for schema idiolects.

Introduction - idiolect

Mutual intelligibility for schema idiolects on ATProto.

Composing schema mappings: Second-order dependencies to the rescue: ACM Transactions on Database Systems: Vol 30, No 4

A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). A fundamental problem is composing schema mappings: given ...

fastino-ai/GLiNER2

Unified Schema-Based Information Extraction

Lexicon - AT Protocol

A schema definition language.

Lexicon - AT Protocol

A schema definition language.

Graceful database schema evolution: the PRISM workbench: Proceedings of the VLDB Endowment: Vol 1, No 1

Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia and public scientific databases: in these projects based on multiparty ...

First Four Tools Join Schema for Interoperability

And we're looking for more

Namespaced Identifiers (NSIDs) - AT Protocol

A specification for global semantic IDs.

Relational foundations for functorial data migration | Proceedings of the 15th Symposium on Database Programming Languages

In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it. We show that morphisms of schemas induce three ''data migration ...

The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits

Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad $\mcT$, capturing this self-similarity. We discuss the algebra $\Rel$ of mathematical relations on $\mcT$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.

panproto/panproto

One engine for schematic version control within and across any schema language.

Lexicons - AT Protocol Docs - AT Protocol

A schema-driven interoperability framework

Unknown Fields in Protobuf

How Protobuf unknown fields enable seamless schema evolution and robust middleware.