[Nepomuk] Review Request: Use graph groups to filter out ontology results

[Vishesh Handa]

-----------------------------------------------------------
This is an automatically generated e-mail. To reply, visit:
http://git.reviewboard.kde.org/r/106878/#review20649
-----------------------------------------------------------


ping

- Vishesh Handa


On Oct. 15, 2012, 2:56 p.m., Vishesh Handa wrote:
> 
> -----------------------------------------------------------
> This is an automatically generated e-mail. To reply, visit:
> http://git.reviewboard.kde.org/r/106878/
> -----------------------------------------------------------
> 
> (Updated Oct. 15, 2012, 2:56 p.m.)
> 
> 
> Review request for Nepomuk and Sebastian Trueg.
> 
> 
> Description
> -------
> 
>     Use graph groups to filter out ontology results
>     
>     Virtuoso has this concept of graph groups. We have added all the
>     ontology graphs + ontology metadata graphs + virtuoso data graph in this
>     graph group.
>     
>     All search results generated by the query engine do not contain results
>     from this graph. This is a much faster approach than the earlier user
>     visibility approach which would cause a huge performance bottleneck.
>     
>     While the current approach is great. It still doesn't solve all our
>     problems. We still get graph results in the negated terms, and we STILL
>     get some ontology results in some queries. Probably a virtuoso bug.
> 
> Can I removed the user visibility update code? I don't think it is required any more.
> 
> 
> Diffs
> -----
> 
>   autotests/test/querytests.cpp 8417599 
>   libnepomukcore/query/query.cpp a0459a5 
>   services/storage/virtuosoinferencemodel.cpp bac2f5e 
> 
> Diff: http://git.reviewboard.kde.org/r/106878/diff/
> 
> 
> Testing
> -------
> 
> 
> Thanks,
> 
> Vishesh Handa
> 
>

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.kde.org/pipermail/nepomuk/attachments/20121022/2d09aee8/attachment.html>