Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

opt5: propagate_degenerate_queries #224

Merged
merged 1 commit into from
Oct 1, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions libursa/QueryOptimizer.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,14 @@ Query q_everything() {
return std::move(q_and(std::move(queries)));
}

// Checks if the query represents every value in the dataset.
// The only cases when it happens are empty and() and min 0 of (...).
// "min 0 of (...)" is simplified in another pass, so just check for and().
// See also comment above.
bool is_everything(const Query &q) {
return q.get_type() == QueryType::AND && q.as_queries().size() == 0;
}

// Run the optimization pases on subqueries.
// After this step, every subquery should be maximally optimized,
// So I believe there's no need to run this in a loop.
Expand Down Expand Up @@ -104,6 +112,38 @@ Query simplify_minof(Query &&q, bool *changed) {
return std::move(q);
}

// Propagate 'everything' results through the query. For example,
// if we know that C is everything, we immediately know OR(a, b, C)
// OR(AND(), b, c) --> AND()
// MIN 3 OF (AND(), b, c, d) --> MIN 2 OF (b, c, d)
Query propagate_degenerate_queries(Query &&q, bool *changed) {
if (q.get_type() == QueryType::MIN_OF) {
std::vector<Query> newqueries;
uint32_t count = q.as_count();
for (auto &&query : q.as_queries()) {
if (is_everything(query)) {
count -= 1;
*changed = true;
if (count == 0) {
return std::move(q_everything());
}
} else {
newqueries.emplace_back(std::move(query));
}
}
return std::move(q_min_of(count, std::move(newqueries)));
}
if (q.get_type() == QueryType::OR) {
for (auto &&query : q.as_queries()) {
if (is_everything(query)) {
*changed = true;
return std::move(q_everything());
}
}
}
return std::move(q);
}

Query q_optimize(Query &&q) {
if (q.get_type() == QueryType::PRIMITIVE) {
// Nothing to improve here.
Expand All @@ -118,6 +158,7 @@ Query q_optimize(Query &&q) {
q = inline_suboperations(std::move(q), &changed);
q = deduplicate_primitives(std::move(q), &changed);
q = simplify_minof(std::move(q), &changed);
q = propagate_degenerate_queries(std::move(q), &changed);
}

return std::move(q);
Expand Down
2 changes: 1 addition & 1 deletion libursa/Version.h.in
Original file line number Diff line number Diff line change
Expand Up @@ -9,5 +9,5 @@ constexpr std::string_view ursadb_format_version = "1.5.0";
// Project version.
// Consider updating the version tag when doing PRs.
// clang-format off
constexpr std::string_view ursadb_version_string = "@PROJECT_VERSION@+opt4";
constexpr std::string_view ursadb_version_string = "@PROJECT_VERSION@+opt5";
// clang-format on
Loading