The new 'trees' storage (1.0.8) is meant to be a faster in memory store (using AVL Trees not hashes for indexes) It was written by Dave Robillard.
Dave Kieron Taylor wrote: > I have queried small triplestores with SPARQL and experienced near > instantaneous responses. 20,000 should be trivial for in-memory queries. > I suspect you're doing something slow in your query, rather than there > being something odd in your data model. > > Would you like to post the query? > > Kieron > > > Lou Sakey wrote: >> I have Redland model with 20,000 triples using the Berkeley DB >> storage option. I am performing a sparql query using >> librdf_new_query() and librdf_query_execute() to search for all >> people that are male and born between two dates. >> >> There are a total of 500 people in the model. Each person has a sex >> property and a birthday property (among others). It took over 8 >> minutes for librdf_query_execute() to complete on a dual core 2.16 >> GHZ processor with 2 gigabytes of memory. >> >> Is this the expected behavior? >> >> Thanks in advance >> >> Lou >> >> > > > > _______________________________________________ > redland-dev mailing list > [email protected] > http://lists.librdf.org/mailman/listinfo/redland-dev > > > !DSPAM:48ac8043184882107185924! > > _______________________________________________ redland-dev mailing list [email protected] http://lists.librdf.org/mailman/listinfo/redland-dev
