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

[Enhancement] improve sql digest for massive compound predicates #53207

Open
wants to merge 2 commits into
base: main
Choose a base branch
from

Conversation

murphyatwork
Copy link
Contributor

@murphyatwork murphyatwork commented Nov 26, 2024

Why I'm doing:

What I'm doing:

In cases where an OR predicate is dynamically constructed with a fixed column, the SQL digest varies due to a differing number of predicates. To address this, we consolidate extensive compound predicates into a compact format, ensuring consistent SQL digests.

where c_code like 'a%';
where c_code like 'a%' or c_code like 'b%';
where c_code like 'a%' or c_code like 'b%' or c_code like 'c%';

=> 

where $massive_compounds[c_code]$

Fixes #issue

What type of PR is this:

  • BugFix
  • Feature
  • Enhancement
  • Refactor
  • UT
  • Doc
  • Tool

Does this PR entail a change in behavior?

  • Yes, this PR will result in a change in behavior.
  • No, this PR will not result in a change in behavior.

If yes, please specify the type of change:

  • Interface/UI changes: syntax, type conversion, expression evaluation, display information
  • Parameter changes: default values, similar parameters but with different default values
  • Policy changes: use new policy to replace old one, functionality automatically enabled
  • Feature removed
  • Miscellaneous: upgrade & downgrade compatibility, etc.

Checklist:

  • I have added test cases for my bug fix or my new feature
  • This pr needs user documentation (for new or modified features or behaviors)
    • I have added documentation for my new feature or new function
  • This is a backport pr

Bugfix cherry-pick branch check:

  • I have checked the version labels which the pr will be auto-backported to the target branch
    • 3.4
    • 3.3
    • 3.2
    • 3.1
    • 3.0

exprs.add((SlotRef) x);
}
});
return "$massive_compounds[" + exprs.stream().map(SlotRef::toSqlImpl)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

SlotRefs are query-specific so unstable, suggest to use original SlotRefs(slotref references to table column) and convert original slotrefs into table columns then sort these columns lexicographically.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

good idea.

if (pair.first + pair.second >= MASSIVE_COMPOUND_LIMIT) {
// Only record de-duplicated slots if there are too many compounds
Set<SlotRef> exprs = Sets.newHashSet();
traverse(node, x -> {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why not use node.collectAllSlotRefs() directly?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

well, I should use it. but it seems I should improve the performance of that method first.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

it constructs a lot of intermediate list,, i'm afraid the performance can be terrible

@Override
public String visitCompoundPredicate(CompoundPredicate node, Void context) {
Pair<Integer, Integer> pair = countCompound(node);
if (pair.first + pair.second >= MASSIVE_COMPOUND_LIMIT) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

How about Expr#flattenPredicate;

Copy link

[FE Incremental Coverage Report]

pass : 33 / 33 (100.00%)

file detail

path covered_line new_line coverage not_covered_line_detail
🔵 com/starrocks/sql/common/SqlDigestBuilder.java 33 33 100.00% []

Signed-off-by: Murphy <[email protected]>
@murphyatwork murphyatwork requested review from a team as code owners November 26, 2024 12:39
Copy link

sonarcloud bot commented Nov 26, 2024

Copy link

[Java-Extensions Incremental Coverage Report]

pass : 0 / 0 (0%)

Copy link

[BE Incremental Coverage Report]

pass : 0 / 0 (0%)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants