Hello,
actually i'm trying to find a solution to compare two string variables
(exact match of the string and if one variable contains the other).
Is it possible (in any way) to use the bif:contains function in this
case? Like /variable1 bif:contains variable2/ (or the other way round) ?
Robert,
bif:strstr (?haystack, ?needle) will return an zero-based position of
of ?needle in ?haystack, or NULL if not found [1]. Thus
FILTER (BOUND (bif:strstr (?haystack, ?needle)))
is what you need.
For similar future needs, note
FILTER (BOUND (bif:strcasestr (?haystack, ?needle)))
Recent
Hello!
I need to clear some graph from Virtuoso database. I execute sparql clear
graph graphName from isql, virtuoso-t takes all my free memory but the
size of database file doesn't become better and even select count(*) from
graph graphName { ?s ?p ?o} doesn't become less. What am I doind wrong?
Hi Alexander,
Its been a while, but one of the last conversation we had about a year was with
regards to clear graph issues you were having in which Ivan had suggested:
Try define sql:log-enable NNN at the beginning of CLEAR GRAPH
statement. That will invoke log_enable (NNN, 1) before the