[Pellet-users] A lot of descendant queries

[Alan Ruttenberg]

Might merit a special case reasoning technique. I've implemented this  
particular case in the past based on a doubly recursive walk of all  
of the subclass relations and the stated part-of relations, which is  
fast, though I never proved it was complete.

The same case occurs for any transitive property like part_of - there  
will be others.

-Alan


On May 3, 2007, at 1:38 PM, bijan at clarkparsia.com wrote:

> On Thu, May 3, 2007 1:20 pm, Alan Ruttenberg  
> <alanruttenberg at gmail.com> said:
>
>> This would be equivalent to the calls I made *if* the sparql engine
>> implemented TBOX queries, which I understand not to be the case in
>> the current version.
>
> Though, we hope, it will be implemented, at least preliminarily, soon.
>
> I need to think a bit as to whether we'd need to special case this  
> sort of query to use something like the classification code (a la  
> Evren's suggestion) or not.
>
> Hmm. *Have* to is strong. Usefully do so, seems right. Basically,  
> you'd want to *order* some of the values in one half of a join and  
> use results from the prior row's evaluation to compute subsequent  
> ones. Interesting. The sorting part is a bit like a sort join, but  
> I don't know if any db technique tries to avoid computation of a  
> row because it can figure it out from a prior row.
>
> The memory issues is separate of course.
>
> Cheers,
> Bijan.
>