----------------------------------------------------------- This is an automatically generated e-mail. To reply, visit: http://git.reviewboard.kde.org/r/107393/#review22285 -----------------------------------------------------------
nepomuk-storage.cpp <http://git.reviewboard.kde.org/r/107393/#comment17136> This is not going to work. The problem is that m_graph is a graph, which can be represented as a list. If you're splitting the graph, then you'll need to split it in a way such that both the new graphs are completely independent (no edges). Otherwise we will get errors. How about just decreasing the timeout for now. I don't think this is something we can fix over here. I'll have to fix it in the storeResources code. - Vishesh Handa 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 > >
_______________________________________________ KDE-Telepathy mailing list [email protected] https://mail.kde.org/mailman/listinfo/kde-telepathy
