Skip to content

Commit

Permalink
Merge branch 'branch-2.1' into branch-2.1-p3
Browse files Browse the repository at this point in the history
  • Loading branch information
eldenmoon authored Sep 5, 2024
2 parents 2a389cd + c6771da commit 4a0d78a
Show file tree
Hide file tree
Showing 20 changed files with 256 additions and 497 deletions.
20 changes: 3 additions & 17 deletions be/src/olap/compaction.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1132,35 +1132,21 @@ Status Compaction::find_longest_consecutive_version(std::vector<RowsetSharedPtr>
if (rowsets->empty()) {
return Status::OK();
}

RowsetSharedPtr prev_rowset = rowsets->front();
size_t i = 1;
int max_start = 0;
int max_length = 1;

int start = 0;
int length = 1;
for (; i < rowsets->size(); ++i) {
RowsetSharedPtr rowset = (*rowsets)[i];
if (rowset->start_version() != prev_rowset->end_version() + 1) {
if (missing_version != nullptr) {
missing_version->push_back(prev_rowset->version());
missing_version->push_back(rowset->version());
}
start = i;
length = 1;
} else {
length++;
break;
}

if (length > max_length) {
max_start = start;
max_length = length;
}

prev_rowset = rowset;
}
*rowsets = {rowsets->begin() + max_start, rowsets->begin() + max_start + max_length};

rowsets->resize(i);
return Status::OK();
}

Expand Down
7 changes: 3 additions & 4 deletions be/src/olap/cumulative_compaction.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -111,11 +111,10 @@ Status CumulativeCompaction::pick_rowsets_to_compact() {
std::vector<Version> missing_versions;
RETURN_IF_ERROR(find_longest_consecutive_version(&candidate_rowsets, &missing_versions));
if (!missing_versions.empty()) {
DCHECK(missing_versions.size() % 2 == 0);
DCHECK(missing_versions.size() == 2);
LOG(WARNING) << "There are missed versions among rowsets. "
<< "total missed version size: " << missing_versions.size() / 2
<< " first missed version prev rowset verison=" << missing_versions[0]
<< ", first missed version next rowset version=" << missing_versions[1]
<< "prev rowset verison=" << missing_versions[0]
<< ", next rowset version=" << missing_versions[1]
<< ", tablet=" << _tablet->tablet_id();
}

Expand Down
274 changes: 0 additions & 274 deletions be/test/olap/cumulative_compaction_test.cpp

This file was deleted.

Original file line number Diff line number Diff line change
Expand Up @@ -1311,15 +1311,14 @@ public static boolean analyzeUniqueKeyMergeOnWrite(Map<String, String> propertie
throw new AnalysisException(PropertyAnalyzer.ENABLE_UNIQUE_KEY_MERGE_ON_WRITE + " must be `true` or `false`");
}

public static boolean analyzeEnableDeleteOnDeletePredicate(Map<String, String> properties,
boolean enableUniqueKeyMergeOnWrite)
public static boolean analyzeEnableDeleteOnDeletePredicate(Map<String, String> properties)
throws AnalysisException {
if (properties == null || properties.isEmpty()) {
return enableUniqueKeyMergeOnWrite ? Config.enable_mow_light_delete : false;
return false;
}
String value = properties.get(PropertyAnalyzer.PROPERTIES_ENABLE_MOW_LIGHT_DELETE);
if (value == null) {
return enableUniqueKeyMergeOnWrite ? Config.enable_mow_light_delete : false;
return false;
}
properties.remove(PropertyAnalyzer.PROPERTIES_ENABLE_MOW_LIGHT_DELETE);
if (value.equals("true")) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -2498,8 +2498,7 @@ private boolean createOlapTable(Database db, CreateTableStmt stmt) throws UserEx

boolean enableDeleteOnDeletePredicate = false;
try {
enableDeleteOnDeletePredicate = PropertyAnalyzer.analyzeEnableDeleteOnDeletePredicate(properties,
enableUniqueKeyMergeOnWrite);
enableDeleteOnDeletePredicate = PropertyAnalyzer.analyzeEnableDeleteOnDeletePredicate(properties);
} catch (AnalysisException e) {
throw new DdlException(e.getMessage());
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -622,7 +622,9 @@ private Statistics estimateBinaryComparisonFilter(Expression leftExpr, DataType
.setMaxExpr(intersectRange.getHighExpr())
.setNdv(intersectRange.getDistinctValues())
.setNumNulls(0);
double sel = leftRange.overlapPercentWith(rightRange);
double sel = leftRange.getDistinctValues() == 0
? 1.0
: intersectRange.getDistinctValues() / leftRange.getDistinctValues();
if (!(dataType instanceof RangeScalable) && (sel != 0.0 && sel != 1.0)) {
sel = DEFAULT_INEQUALITY_COEFFICIENT;
}
Expand Down
Loading

0 comments on commit 4a0d78a

Please sign in to comment.