W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2004

Re: Potential Requirement: Predicate support with boolean operato rs

From: Farrukh Najmi <Farrukh.Najmi@Sun.COM>
Date: Wed, 05 May 2004 08:53:33 -0400
To: "Thompson, Bryan B." <BRYAN.B.THOMPSON@saic.com>
Cc: "'Dan Connolly '" <connolly@w3.org>, "'public-rdf-dawg-request@w3.org '" <public-rdf-dawg-request@w3.org>, "'RDF Data Access Working Group '" <public-rdf-dawg@w3.org>
Message-id: <4098E3CD.7040703@sun.com>

Thompson, Bryan B. wrote:

>Or do you mean like Prolog predicates with and/or/not operators?
I am not familiar with Prolog but I suspect the answer is Yes. An example
of what I am talking about is predicates in SQL-92 with and/or/not 

The requirement I see is the ability to restrict the results of the 
query by multiple predicates.
The more predicates one specifies, the more specific is the query and 
the more restricted is
the result.

Looking at XQuery Requirements:


the closest requirement I find is 3.4.5:

3.4.5 Combination

    The XML Query Language MUST
    <http://www.w3.org/TR/xquery-requirements/#terminology-must> be able
    to combine related information from different parts of a given
    document or from multiple documents.

Looking at DAWG requirements I am not sure I see anything like it. It is 
possible that "3.1 Multi-edged Paths" was intended
to cover support for multiple predicates.

Received on Wednesday, 5 May 2004 08:53:40 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:00:26 UTC