Suppose I have an XSD file having below lines of code;
|xsd:simpleType name=test
xsd:restriction base=xsd:string
xsd:maxLength value=50 /
/xsd:restriction
/xsd:simpleType
|
What I am trying to do is to convert this xsd simple type into an
instance of rdfs:Datatype in an
Without knowing much about TDB architecture I can still describe a
couple of things.
One of the most important aspects of speed of indexing and size of the
resulting store is the shape of the data. Some data sets have many
unique resources, meaning that there are lots of URIs and unique
string
On Fri, Jun 22, 2012 at 9:30 AM, Dimitris Spanos dimi.s...@gmail.com wrote:
Hello all,
I'm trying to traverse and process the algebra expression tree for a
SPARQL query. For this purpose, I have created a class that implements
OpVisitor and visits the entire tree in a top-down fashion.
Off the top of my head I believe loading into an empty database is always
faster because of the way it generates the index files and node tables.
When loading to an existing dataset it tends to be slower because it has
to add to the existing files rather than generating them from scratch.
It might not be the traditional solution, but I've done some SPARQL query
transformations with RDF/XML and XSLT 2.
It doesn't work on the algebra level, but rather on the SPIN serialization.
It might or might not be easier than Java code. I don't know if that
applies in your case.
Martynad
Thank you Paul for your truly insightful response. I will try to
clarify a few things though,
On Fri, Jun 22, 2012 at 7:09 PM, Paul Gearon gea...@ieee.org wrote:
On Fri, Jun 22, 2012 at 9:30 AM, Dimitris Spanos dimi.s...@gmail.com wrote:
Hello all,
I'm trying to traverse and process the
