为不确定的多维数值数据设计了支持概率查询的SPARQL扩展。
ProbSPARQL: Querying Knowledge Graphs with Multi-dimensional, Uncertain Numeric Data

- 将不确定数值建模为随机变量,用概率字面量表示分布
- 支持概率过滤和基于散度的连接,实测在150万三元组上可行
- 适合处理工业回收中传感器测量数据的可靠性分析
SFB 1574循环工厂正在构建共享知识图谱基础设施,用于整合退货产品的数据。核心挑战在于,循环工厂数据包含来自传感器或基于传感器推导的多维数值测量,且具有固有不确定性,而下游的分类、验证、可靠性建模和再组装规划模块需要可查询的不确定性表达。现有RDF和SPARQL技术缺乏对这类不确定数值数据的统一查询与分析支持。为此,我们提出ProbSPARQL,一种向上兼容的SPARQL扩展,作为该基础设施的早期查询层试点。ProbSPARQL将不确定数值建模为随机变量,其分布通过概率RDF字面量数据类型编码,并支持分布感知表达式、概率过滤器和基于散度的连接。我们在Apache Jena ARQ上实现ProbSPARQL,通过兼容Fuseki的执行层暴露。我们使用项目衍生的测量片段(涵盖GMM编码的不确定性及基于直方图的实测粗糙度分布)评估真实数据适用性,并在符合本体的受控基准上独立评估可扩展性,最多包含5,000个角磨机实例和150万三元组。结果表明,引擎内执行可行,过滤下推相比应用层后处理提速,不同散度连接策略存在延迟-精度权衡。
原文摘要 · Abstract (English)
The SFB 1574 Circular Factory is building a shared knowledge graph infrastructure for integrating data about returned products. A central challenge is that circular-factory data include numeric measurements that (i) originate from sensors or are derived from sensor-based measurements, (ii) are frequently multi-dimensional, and (iii) are inherently uncertain, while downstream triage, validation, reliability-modeling, and reassembly-planning modules require queryable uncertainty representations. Current RDF and SPARQL technologies lack native support for harmonized querying and analysis of such uncertain numeric measurement data. To address this gap, we present ProbSPARQL, an upward-compatible SPARQL extension developed as an early-stage query-layer pilot for this infrastructure. ProbSPARQL models uncertain numeric values as random variables whose distributions are encoded by probabilistic RDF literal datatypes, and supports distribution-aware expressions, probabilistic filters, and divergence-based joins. We implement ProbSPARQL on Apache Jena ARQ and expose it through a Fuseki-compatible execution layer. We assess real-data applicability using project-derived measurement fragments covering GMM-encoded uncertainty and histogram-based empirical roughness distributions, and evaluate scalability separately on controlled ontology-conformant benchmarks with up to 5,000 angle-grinder instances and 1.5M triples. The results show feasible in-engine execution, filter-pushdown speedups over application-layer post-processing, and latency-accuracy trade-offs among divergence-join decision strategies.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。