diff options
author | Christian Mollekopf <chrigi_1@fastmail.fm> | 2015-08-23 18:56:43 +0200 |
---|---|---|
committer | Christian Mollekopf <chrigi_1@fastmail.fm> | 2015-08-23 18:56:43 +0200 |
commit | 1acf9f3c486813df807ff6931e56cc13eb26eeaf (patch) | |
tree | 559ead2e95986515b4a5f93b6f143b8f1d429bd3 /common/entitystorage.cpp | |
parent | 62e7084dcd6f53275fcb21ba17e880e41b40094d (diff) | |
download | sink-1acf9f3c486813df807ff6931e56cc13eb26eeaf.tar.gz sink-1acf9f3c486813df807ff6931e56cc13eb26eeaf.zip |
Store indexes as named databases in the same db.
Because we also keep using the same transactions this finally makes
the resource somewhat performant. On my system genericresourcebenchmark
now processes ~4200 messages per second instead of ~280.
Diffstat (limited to 'common/entitystorage.cpp')
-rw-r--r-- | common/entitystorage.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/common/entitystorage.cpp b/common/entitystorage.cpp index 420c3b0..22fd9e6 100644 --- a/common/entitystorage.cpp +++ b/common/entitystorage.cpp | |||
@@ -91,10 +91,10 @@ ResultSet EntityStorageBase::filteredSet(const ResultSet &resultSet, const std:: | |||
91 | return ResultSet(generator); | 91 | return ResultSet(generator); |
92 | } | 92 | } |
93 | 93 | ||
94 | ResultSet EntityStorageBase::getResultSet(const Akonadi2::Query &query, const Akonadi2::Storage::Transaction &transaction, qint64 baseRevision, qint64 topRevision) | 94 | ResultSet EntityStorageBase::getResultSet(const Akonadi2::Query &query, Akonadi2::Storage::Transaction &transaction, qint64 baseRevision, qint64 topRevision) |
95 | { | 95 | { |
96 | QSet<QByteArray> appliedFilters; | 96 | QSet<QByteArray> appliedFilters; |
97 | ResultSet resultSet = queryIndexes(query, mResourceInstanceIdentifier, appliedFilters); | 97 | ResultSet resultSet = queryIndexes(query, mResourceInstanceIdentifier, appliedFilters, transaction); |
98 | const auto remainingFilters = query.propertyFilter.keys().toSet() - appliedFilters; | 98 | const auto remainingFilters = query.propertyFilter.keys().toSet() - appliedFilters; |
99 | 99 | ||
100 | //We do a full scan if there were no indexes available to create the initial set. | 100 | //We do a full scan if there were no indexes available to create the initial set. |