tursom/memgraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Set first looking indices then constraints

Browse Source
This commit is contained in:
Josip Mrden
2023-10-23 13:29:48 +02:00
parent ab40115b1e
commit d908ce76cd
1 changed files with 9 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/storage/v2/inmemory/storage.hpp
View File

@@ -116,11 +116,11 @@ class InMemoryStorage final : public Storage {
/// Note that this is always an over-estimate and never an under-estimate.
uint64_t ApproximateVertexCount(LabelId label, PropertyId property) const override {
auto *mem_storage = static_cast<InMemoryStorage *>(storage_);
if (mem_storage->constraints_.unique_constraints_->ConstraintExists(label, {property})) {
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property);
if (mem_storage->indices_.label_property_index_->IndexExists(label, property)) {
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property);
}
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property);
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property);
}
/// Return approximate number of vertices with the given label and the given
@@ -128,11 +128,11 @@ class InMemoryStorage final : public Storage {
/// and never an under-estimate.
uint64_t ApproximateVertexCount(LabelId label, PropertyId property, const PropertyValue &value) const override {
auto *mem_storage = static_cast<InMemoryStorage *>(storage_);
if (mem_storage->constraints_.unique_constraints_->ConstraintExists(label, {property})) {
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property, value);
if (mem_storage->indices_.label_property_index_->IndexExists(label, property)) {
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property, value);
}
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property, value);
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property, value);
}
/// Return approximate number of vertices with the given label and value for
@@ -142,11 +142,10 @@ class InMemoryStorage final : public Storage {
const std::optional<utils::Bound<PropertyValue>> &lower,
const std::optional<utils::Bound<PropertyValue>> &upper) const override {
auto *mem_storage = static_cast<InMemoryStorage *>(storage_);
if (mem_storage->constraints_.unique_constraints_->ConstraintExists(label, {property})) {
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property, lower, upper);
if (mem_storage->indices_.label_property_index_->IndexExists(label, property)) {
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property, lower, upper);
}
return mem_storage->indices_.label_property_index_->ApproximateVertexCount(label, property, lower, upper);
return mem_storage->constraints_.unique_constraints_->ApproximateVertexCount(label, property, lower, upper);
}
template <typename TResult, typename TIndex, typename TIndexKey>