- From: Eric Prud'hommeaux <eric@w3.org>
- Date: Tue, 29 Jun 2004 07:03:24 -0400
- To: public-rdf-dawg@w3.org
- Message-ID: <20040629110324.GE20261@w3.org>
[[ 4.5 Aggregate Query It should be possible to specify two or more RDF graphs against which a query shall be executed; that is, the result of an aggregate query is the merge of the results of executing the query on each of two or more graphs. ]] This states that we perform the query on each of the (two or more) graphs. My intuition is that we want to perform the query on the aggregation of the graphs. For instance, one: bob knows joe. joe eats rice. bob knows jane. two: jane eats rice. bob knows pat. pat eats rice. Q: bob knows X. X eats rice. from one: X is joe. from two: X is jane aggregation of performing the query on each of one and two: X is joe. X is jane. performing the query on the aggregation of each of one and two: X is joe. X is jane. X is pat. Maybe this was already decided in favor of the former; I don't recall. -- -eric office: +81.466.49.1170 W3C, Keio Research Institute at SFC, Shonan Fujisawa Campus, Keio University, 5322 Endo, Fujisawa, Kanagawa 252-8520 JAPAN +1.617.258.5741 NE43-344, MIT, Cambridge, MA 02144 USA cell: +1.857.222.5741 (does not work in Asia) (eric@w3.org) Feel free to forward this message to any list for any purpose other than email address distribution.
Received on Tuesday, 29 June 2004 07:03:24 UTC