Greenfox – a schema language for validating file systems
summary
Greenfox is a schema language that validates an arbitrary file‑system tree (a chosen folder and its descendants) using an XDM-based model and XPath/foxpath/XQuery expressions. It implements SHACL‑style value shapes (map resource → XDM value) and folder/file shapes with targets, cardinality, checksums, last‑modified and cross‑resource rules (e.g., docbook with image data requires a sibling image folder). A 100% XQuery reference implementation runs on BaseX and is available on GitHub.
AI-written summary · about
chapters (23)
- 0:00Intro
- 0:24Greenfox: definition
- 0:37File system validation
- 0:55Conventional validation - some basic limitations
- 3:10A first schema, with a folder shape
- 6:56A folder shape, containing a file shape
- 7:38Nesting shapes - subsetting
- 8:44Nesting shapes - if outer target, then inner
- 9:31Validating JSON contents
- 10:18Key feature #1 - XDM based
- 11:01Navigation skills
- 11:42Validation concept
- 12:51Concepts
- 15:42What a constraint perceives
- 16:39Constraining resource values Value shape, declaring a constraint
- 17:14Expression tandems
- 19:12folder resource values
- 20:44external resource value
- 21:33Exploring files with shifting focus nodes
- 23:14Constraint components Resource shapes
- 23:48User-defined constraints
- 26:17Pouring waters of validity
- 27:13Implementation
related talks
30mA Language For Enhancing File System Tests
33mEMF, JSON and I
19mConfD: Analyzing Configuration Dependencies of File Systems for Fun and Profit
04mLightning Talk JSON Schema
36mArkisto: an open-source, standards-based framework for digital preservation
27mGraphQL: Towards a universal query language
42mProduction FS: Adapt or Die
25mFull-stack forms with JSON Schemas