Schema-Agnostic Database Access¶
A query-mediation capability that maps user terminology and structure onto an unfamiliar or changing database schema, constructs executable interpretations, and exposes ambiguity without requiring native vocabulary knowledge.
Core Idea¶
Schema-agnostic access addresses the semantic gap between an information need and a database's representational choices. Users describe desired entities and relations in their own vocabulary; the system discovers candidate mappings to tables, properties, predicates, joins, or graph paths.
The result must be more than keyword search. Mapped concepts are composed into an executable structured query, competing interpretations are ranked or clarified, and answers retain provenance to the selected schema elements. Natural language, keywords, and relaxed structured syntax are possible front ends to this mediation task.
Scope of Application¶
- Knowledge graphs. Maps user concepts onto heterogeneous predicates and paths.
- Data integration. Queries sources with independent vocabularies and structures.
- Natural-language interfaces. Grounds utterances in executable database semantics.
- Exploratory analytics. Lowers the entry cost where schemas are large or rapidly changing.
Clarity¶
State which schema knowledge is not required, which metadata or ontologies the system uses, how relations are composed, and how ambiguity is surfaced. Vocabulary independence is a degree, not an all-or-nothing property. Inclusion test: Accept a query that does not use native schema names, map its concepts and relations to candidate schema structures, execute a structured interpretation, and expose ambiguity or provenance. Exclusion test: Exclude schema-less storage, fixed hand-authored query templates, keyword document retrieval with no relational composition, and interfaces that merely hide SQL while still requiring table knowledge. Nearest boundary: A natural-language interface describes the input mode; it is schema-agnostic only when it also resolves unfamiliar dataset vocabulary and structure. Exit condition: The capability fails when users must supply native field names or when semantic matches cannot be composed into an executable data query.
Manages Complexity¶
The abstraction separates user intent from data representation while concentrating uncertainty in a mediation layer. It makes heterogeneous data usable but demands explicit ranking, provenance, and correction mechanisms.
Abstract Reasoning¶
- Parse entities, relations, constraints, and answer type from the request.
- Retrieve candidate schema elements using lexical and semantic evidence.
- Compose candidates into structurally valid interpretations.
- Rank, clarify, or expose alternatives before execution.
- Execute and return answers with mapping provenance.
Knowledge Transfer¶
The pattern transfers across relational, graph, and federated data when a formal query can be grounded. It does not transfer directly to unstructured retrieval without a representational mapping problem.
Relationships to Other Abstractions¶
Current abstraction Schema-Agnostic Database Access Domain-specific
Parents (1) — more general patterns this builds on
-
Schema-Agnostic Database Access is a kind of Semantic translation Domain-specific
Schema-Agnostic Database Mediation is Semantic Translation from user concepts and structures into executable terms of an unfamiliar or changing database schema.
Hierarchy paths (2) — routes to 2 parentless roots
- Schema-Agnostic Database Access → Semantic translation → Equivalence-Preserving Rewriting → Transformation → Function (Mapping)
- Schema-Agnostic Database Access → Semantic translation → Equivalence-Preserving Rewriting → Equivalence Relation
Neighborhood in Abstraction Space¶
Schema-Agnostic Database Access sits in a moderately populated region (41st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Matrices, Measures & Numeric Structures (30 abstractions)
Nearest neighbors
- Database Index — 0.90
- Data Format — 0.87
- Query Theory — 0.87
- Decision Tree Model — 0.86
- Distance Matrix — 0.86
Computed from structural-signature embeddings · 2026-10-08