On the primitivity of operators in SPARQL

The paper studies the primitivity of the basic operators UNION, AND, OPTIONAL, FILTER, and SELECT, as they are used in the SPARQL query language. The question of whether one operator can be expressed in terms of the other operators is answered in detail. It turns out that only AND is non-primitive. These results are shown to be insensitive to the choice of semantics for filter conditions (three-valued or two-valued). It is also shown that these two semantics can simulate each other.     

基于RDF图结构切分的高效子图匹配方法

针对在SPARQL查询处理中,随着查询图结构逐渐复杂而导致基于图的查询效率愈发低下的问题,通过分析几种资源描述框架（RDF）图的基本结构,提出了一种基于查询图结构切分的子图匹配方法——RSM。首先,将查询图切分为若干结构简单的查询子图,并通过相邻谓词结构索引来定义查询图节点的搜索空间;然后,通过相邻子图结构来缩小搜索空间范围,在数据图中根据搜索空间中的搜索范围找到符合的子图结构;最后,将得到的子图进行连接并作为查询结果输出。将RSM与RDF-3X、R3F、GraSS等主流查询方法作比较,对比了各方法在不同数据集上对于复杂程度不同的查询图的查询响应时间。实验结果充分表明,与其他3种方法相比,在处理结构复杂的查询图时,RSM的查询响应时间更短,具有更高的查询效率。     

SPARQL查询引擎设计

论文以通用的不依赖于具体RDF平台的SPARQL查询引擎的设计与实现作为研究对象。并从SPARQL语法解析器、引擎系统的优化设计等方面进行了深入的探讨,提出了合理的设计策略和实现方法。     

Formal development of an operation monitoring and control system for nuclear reactors using Event-B method

Nuclear power plants are complex systems with many regulations, requirements, procedures, and operational constraints. The future autonomous safety monitoring and control system of nuclear plants require a constructive method in integrating and aggregating the accumulated knowledge database normally written in human language. For safety critical systems, formal methods such as model checking and theorem proving are used for verifying its conformance of safety requirements. However, formal specifications and implemented application codes are virtually unreadable for domain experts. To enhance this communication bottleneck and to boost productivity, we use semantic web technology to relate formal specifications with ontologies that are human-readable and have formal semantics. We introduce a nuclear reactor ontology of controlled vocabulary to link elements in a physical system and its Event-B model (a formal method for system-level modeling and analysis). Controlled vocabulary provides several benefits. It is still construction of a spoken language and thus, human readable and transparent. Their formal semantics make it easy to integrate them to the counterparts in their specification. We can generate system logs those are both human and machine friendly. Practitioners can write ad hoc query using SPARQL Protocol and RDF Query Language (SPARQL). As a proof of concept of our methodology, we build a system for safety monitoring and control of a nuclear reactor. We prototype our monitoring system in Event-B model and verify that it satisfies safety requirements and constraints. Then we build an OWL 2 ontology for the semantic web from the Event-B model annotating all metrics and events of the system monitors.     

一种支持用户偏好的RDF模糊查询方法

RDF模糊查询是实现语义Web智能检索的重要组成部分,利用Zadeh的Ⅱ型模糊集合理论、α-截集及语言变量概念,提出了支持用户偏好的RDF模糊查询方法,其扩展了SPARQL语言来实现模糊及偏好表达,构造了有序语言值子域表来实现模糊值到相应子域的映射,以确定隶属度区间。利用去模糊化规则,将扩展的查询转换为标准SPARQL,利用现有的SPARQL查询引擎实现模糊查询操作。为验证提出的方法,开发了fp-SPARQL实验系统。实验结果表明,该方法提高了RDF模糊查询效率,增强了用户对查询结果的满意度。     

Querying for provenance, trust, uncertainty and other meta knowledge in RDF

The Semantic Web is based on accessing and reusing RDF data from many different-sources, which one may assign different levels of authority and credibility. Existing Semantic Web query languages, like SPARQL, have targeted the retrieval, combination and re-use of facts, but have so far ignored all aspects of meta knowledge, such as origins, authorship, recency or certainty of data.In this paper, we present an original, generic, formalized and implemented approach for managing many dimensions of meta knowledge, like source, authorship, certainty and others. The approach re-uses existing RDF modeling possibilities in order to represent meta knowledge. Then, it extends SPARQL query processing in such a way that given a SPARQL query for data, one may request meta knowledge without modifying the query proper. Thus, our approach achieves highly flexible and automatically coordinated querying for data and meta knowledge, while completely separating the two areas of concern.     

Solving the SPARQL query containment problem with SpeCS

The query containment problem is a fundamental computer science problem which was originally defined for relational queries. With the growing popularity of the sparql query language, it became relevant and important in this new context: reliable and efficient sparql query containment solvers may have various applications within static analysis of queries, especially in the area of query optimizations and refactoring. In this paper, we present a new approach for solving the query containment problem in sparql. The approach is based on reducing the query containment problem to the satisfiability problem in first order logic. It covers a wide range of the sparql language constructs, including union of conjunctive queries, blank nodes, projections, subqueries, clauses from, filter, optional, graph, etc. It also covers containment under rdf schema entailment regime, and it can deal with the subsumption relation. We describe an implementation of the approach, an open source solver SpeCS and its thorough experimental evaluation on two relevant benchmarks, Query Containment Benchmark and SQCFramework. As a side result, SpeCS identified incorrect test cases within both benchmarks, which were manually checked, confirmed and fixed, resulting in better and more reliable benchmarks. The evaluation also shows that SpeCS is highly efficient and that compared to the state-of-the-art solvers, it gives more precise results in a shorter amount of time. In addition, SpeCS has the highest coverage of the supported language constructs.     

A survey of RDF data management systems

RDF is increasingly being used to encode data for the semantic web and data exchange. There have been a large number of works that address RDF data management following different approaches. In this paper we provide an overview of these works. This review considers centralized solutions (what are referred to as warehousing approaches), distributed solutions, and the techniques that have been developed for querying linked data. In each category, further classifications are provided that would assist readers in understanding the identifying characteristics of different approaches.