HighlightCurated by Aramai Editorialgit.nextgraph.org

oxigraph

A Rust-based graph database implementing the SPARQL standard.

Oxigraph is a graph database written in Rust that implements the SPARQL standard. It provides a compliant, safe, and fast graph database based on the RocksDB key-value store. Oxigraph also includes utility functions for reading, writing, and processing RDF files.

Based on: oxigraph · git.nextgraph.org

HighlightCurated by Aramai Editorialgithub.com

DuckDB RDF Extension

A DuckDB extension to read and write RDF files directly.

This extension allows reading and writing RDF files in DuckDB, supporting various formats such as Turtle, NTriples, NQuads, and TriG. It uses the SERD library for parsing and writing RDF data. The extension also supports WebAssembly (WASM) builds and compression formats like Gzip and Zst.

Based on: GitHub - nonodename/duck_rdf: RDF file extension for DuckDB. Reads and writes supported · github.com

HighlightCurated by Aramai EditorialProceedings of the ACM on Management of Data

PG-Schema: Schemas for Property Graphs

A formalism for specifying property graph schemas with flexible type definitions and expressive constraints.

The authors propose PG-Schema, a simple yet powerful formalism for specifying property graph schemas. It features flexible type definitions supporting multi-inheritance and expressive constraints based on the recently proposed PG-Keys formalism. The paper provides the formal syntax and semantics of PG-Schema, meeting principled design requirements grounded in contemporary property graph management scenarios.

Based on: PG-Schema: Schemas for Property Graphs · Proceedings of the ACM on Management of Data

HighlightCurated by Aramai EditorialVLDB Endowment

QSE: Extraction of Validating Shapes from Very Large Knowledge Graphs

Proposes a Quality Shapes Extraction approach for extracting validating shapes in very large knowledge graphs.

The paper presents the QSE approach, which uses SHACL/ShEx to extract validating shapes from large knowledge graphs. It provides both exact and approximate solutions with confidence metrics. The authors achieve significant speed improvements and spurious shape reductions on DBpedia.

Based on: QSE: Extraction of Validating Shapes from Very Large Knowledge Graphs · VLDB Endowment