LARQ query with GRAPH clause

[Frank Budinsky]

Hi,

We've noticed that this (unionDefaultGraph = true) query:

SELECT ?subject ?predicate ?object ?score
  WHERE {
    (?object ?score) <http://jena.hpl.hp.com/ARQ/property#textMatch>
"cruise" .
    ?subject ?predicate ?object .
  }
ORDER BY Desc(?score)

runs significantly faster (i,e., 100x) than this one:

SELECT ?subject ?predicate ?object ?graph ?score
  WHERE {
    GRAPH ?graph {
      (?object ?score) <http://jena.hpl.hp.com/ARQ/property#textMatch>
"cruise" .
      ?subject ?predicate ?object .
    }
  }
ORDER BY Desc(?score)

Is that expected, and if so, is there another (more efficient) way of
writing such a query that also returns the graphs of the matches?

Thanks,
Frank.