Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16698

GQL Datatypes as an RDF Vocabulary

Dominik Tomaszuk·Daniel Szałaj
View original source ↗Read source document ↗Export metadata ↓

Abstract

The ISO GQL standard introduces a rich value-type system for property graphs, including scalar, temporal, byte-string, list, record, and dynamic union datatypes. The vocabulary presented here additionally covers a vector extension. At the same time, RDF-based knowledge graph systems identify literal datatypes by IRIs and interpret typed literals through value spaces, lexical spaces, and lexical-to-value mappings. This paper presents the GQL Datatypes RDF Vocabulary, a lightweight RDF vocabulary that represents selected GQL datatypes and the vector extension as RDF datatype IRIs and describes their hierarchy, aliases, and selected constraints using RDF, RDFS, OWL, and XML Schema Datatypes vocabulary terms. The vocabulary is intended to support interoperability between GQL-oriented property graph systems and RDF-based knowledge graph systems. We describe its namespace and datatype model, summarize its datatype coverage, and show how the accompanying generator and validator use the vocabulary. In the reference implementation, RDF literals retain GQL datatype IRIs; XSD mappings declared in the vocabulary support scalar validation, while lists, records, and vectors are encoded directly as JSON lexical forms of vocabulary-typed literals.

Explore related subjects

cs.DB

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominik Tomaszuk, Daniel Szałaj. 2026-10-12. GQL Datatypes as an RDF Vocabulary. https://arxiv.org/abs/2610.16698

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Query Repairs

We formalize and study the problem of repairing database queries based on user feedback in the form of a collection of labeled examples. We propose a framework based on the notion of a proximity pre-order, and we investigate and compare query repairs for conjunctive queries (CQs) using different such pre-orders. The proximity pre-orders we consider are based on query containment and on distance metrics for CQs.

cs.DB↗
arXiv2026

Towards a B+-tree with Fluctuation-Free Performance

Performance predictability is critical for modern DBMSs. Index maintenance can trigger rare but severe I/O spikes. In a B/B+-tree of Height H, due to node split propagation, the cost of a single insert can vary from (H + 1) I/Os when node split does not happen to (3H + 1) I/Os when split propagation reaches the root, nearly a 3 times degradation. We formalize performance fluctuation as the gap between the best- and worst-case insert behaviors. We show examples of why performance fluctuation is worth investigating. To mitigate the B/B+-tree split propagation, we introduce the FFBtree, a B+-tree with a novel insert and delete algorithms with bounded-fluctuation performance. We prove that the insert operation is guaranteed to encounter at most one node that needs to be split, and hence ensuring that no split propagation can take place. The new insert and delete algorithms guarantee bounded-fluctuation performance for the FFBtree. Experiments with simulated indexes show that the FFBtree caps I/O fluctuation compared to baseline indexes under various workloads.

cs.DB↗
arXiv2026

Are Diffusion Language Models Good Database Analysts?

Diffusion Language Models (DLMs) enable iterative global refinement, but their effectiveness in Natural Language to SQL (NL2SQL) remains unclear because heterogeneous architectures and evaluation setups hinder fair comparison with autoregressive (AR) models. Their iterative denoising process permits sequence-wide revision, offering a different way to handle the long-range structural dependencies in SQL. We present a systematic study of DLM-based NL2SQL under a unified framework that standardizes generation and execution across DLM architectures. We further introduce SQL-D1, an agentic inference framework combining database-aware retrieval, multi-trajectory denoising, execution-guided verification, and selection based on execution denotations. Across diverse benchmark settings, strong DLMs are competitive with some open-source AR models and offer flexible trade-offs between efficiency and accuracy, although they still trail the strongest AR systems on difficult queries. Test-time scaling yields substantial gains, whereas standard supervised fine-tuning yields unstable outcomes across the evaluated DLMs. Stronger model variants exhibit fewer schema-grounding errors, but failures involving complex clauses and query nesting persist. These results clarify the capabilities and limitations of DLMs for database analysis and provide a standardized foundation for future work. Our code is available at https://anonymous.4open.science/r/SQL-D1-82DF.

cs.DB↗