Review Request: Temp fix for the graph size limitation

[Daniele Elmo Domenichelli]

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



nepomuk-storage.cpp
<http://git.reviewboard.kde.org/r/107393/#comment17135>

    I'm not sure if Nepomuk2::SimpleResourceGraph supports multiple insertion, but perhaps you could use QList<T>::mid(int pos, int length = -1) instead of copying them manually.
    
    http://developer.qt.nokia.com/doc/qt-4.8/qlist.html#mid


- Daniele Elmo Domenichelli


On Nov. 21, 2012, 6:59 a.m., Martin Klapetek wrote:
> 
> -----------------------------------------------------------
> This is an automatically generated e-mail. To reply, visit:
> http://git.reviewboard.kde.org/r/107393/
> -----------------------------------------------------------
> 
> (Updated Nov. 21, 2012, 6:59 a.m.)
> 
> 
> Review request for Telepathy and Vishesh Handa.
> 
> 
> Description
> -------
> 
> If we push too big graph into Nepomuk, it won't get stored because the generated sql is wayyyy to big for virtuoso to process. This is a quick fix/hack/workaround that splits the graph into smaller graphs (max 200 items) and stores these smaller graphs.
> 
> 
> Diffs
> -----
> 
>   nepomuk-storage.cpp 0ab6cba 
> 
> Diff: http://git.reviewboard.kde.org/r/107393/diff/
> 
> 
> Testing
> -------
> 
> Successfully stored 400 contacts in Nepomuk (in overall graph size terms that's more than 600 items graph).
> 
> 
> Thanks,
> 
> Martin Klapetek
> 
>

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.kde.org/pipermail/kde-telepathy/attachments/20121121/e572035b/attachment.html>