W3C is pleased to receive the RDQL submission from HP.
The RDQL specification represents a concise summary of an approach to querying RDF that has been evolving since W3C first solicited RDF query proposals at the Query Languages 1998 (QL'98) Workshop.
RDQL presents a simple mechanism for querying RDF graphs, articulating an approach which has, in various forms, underpinned the majority of RDF query language proposals. Informal developer discussions are already underway within the RDF Interest Group's www-rdf-rules list to identify the points of variation and innovation between RDQL and other RDF query proposals such as Algae, Squish, RQL, RDFQ, etc. (see survey, and testing pages for details). The RDQL submission is particularly welcome in this context as it provides a 'strawman' target for discussion, testing, evaluation against use cases and consideration for possible standardization.
It is now over five years since W3C's QL'98 Workshop. While no formal W3C Working Group on RDF query was chartered during that period, pre-standardization work on RDF query mechanisms has proceeded through informal developer and industry discussions, in the RDF Interest Group and elsewhere. RDQL and related approaches have been maturing, and W3C is currently considering the charter and scope of a Working Group in this area. A draft charter was recently circulated amongst RDF query implementors for discussion.
Key considerations in this are the relationships between RDF query and W3C's existing work on XML Query (XQuery), on the Web Ontology Language (OWL), and possible future work on RDF-based rule languages. Discussion of the technical issues surrounding integration amongst these approaches is particularly welcome on the www-rdf-rules list where it will help set the context for any future standardization work on data-oriented RDF query languages such as RDQL. Information from application developers who have worked with RDQL-based query engines will be of particular use in understanding the design tradeoffs in this area.
The RDQL submission presents an approach for integrating simple RDF query with (for example) OWL and rule-aware systems, by noting that:
If the implementation of that graph provides inferencing to appear as "virtual triples" (i.e. triples that appear in the graph but are not in the ground facts) then an RDQL will include those triples as possible matches in triple patterns. RDQL makes no distinction between inferred triples and ground triples.
This approach suggests a strategy for possible standardization: an RDQL-like language could be developed and deployed without detailed treatment of rule or inference facilities, yet subsequently be used to query "smarter" RDF services which make use of inferences licensed by OWL or RDF-rule semantics.
RDQL as presented in this submission does not provide special-case support for querying of RDF containers and collections, for marking certain statements as 'optional', nor for querying the source or 'provenance' of RDF statements. The resulting simplicity of the specification adds to the appeal of RDQL as a mechanism for RDF query; however further discussion and evaluation is needed to determine the costs and benefits associated with these design tradeoffs.
The RDQL submission presents both a textual grammar for representing RDF queries, as well as a "quick description of the key elements of the query language". While the description gives a good general overview of this approach to RDF query, it does not itself constitute a full specification for an RDF query language. Experience with the RDF Core and Web Ontology specifications suggests that a more detailed elaboration (including formal semantics, test cases) is essential to ensuring reliable interoperability amongst independent implementations. HP's RDQL submission represents a valuable step towards such a specification, consolidating ideas that have been explored by RDF implementors and which could usefully be developed further if new work is chartered in this area.
$Id: Comment.html,v 1.18 2023/09/05 12:32:45 denis Exp $