Open Anzo does not yet support SPARQL DESCRIBE queries, though it is a
bug that the result is an NPE.
We've considered various designs for DESCRIBE X implementations, ranging
from:
* X ?p ?o
* X ?p ?o UNION ?s ?p X
* concise bounded description of X
* contents of named graph X
* minimum spanning graphs
We've also considered extending DESCRIBE to allow an algorithm to be
explicitly given and looked up in a registry.
To help inform future design & implementation of DESCRIBE, can you let
us know which of these meets your use case needs?
If anyone else has an opinion, please share it as well.
thanks,
Lee
>
>
> >
--
Lee Feigenbaum
VP Technology & Standards, Cambridge Semantics Inc
l...@cambridgesemantics.com
1-617-553-1060