-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
1cf55e4
commit 67618a7
Showing
7 changed files
with
237 additions
and
20 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
129 changes: 129 additions & 0 deletions
129
datafusion/physical-plan/src/aggregates/group_values/bytes_view.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,129 @@ | ||
// Licensed to the Apache Software Foundation (ASF) under one | ||
// or more contributor license agreements. See the NOTICE file | ||
// distributed with this work for additional information | ||
// regarding copyright ownership. The ASF licenses this file | ||
// to you under the Apache License, Version 2.0 (the | ||
// "License"); you may not use this file except in compliance | ||
// with the License. You may obtain a copy of the License at | ||
// | ||
// http://www.apache.org/licenses/LICENSE-2.0 | ||
// | ||
// Unless required by applicable law or agreed to in writing, | ||
// software distributed under the License is distributed on an | ||
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | ||
// KIND, either express or implied. See the License for the | ||
// specific language governing permissions and limitations | ||
// under the License. | ||
|
||
use crate::aggregates::group_values::GroupValues; | ||
use arrow_array::{Array, ArrayRef, RecordBatch}; | ||
use datafusion_expr::EmitTo; | ||
use datafusion_physical_expr::binary_map::OutputType; | ||
use datafusion_physical_expr_common::binary_view_map::ArrowBytesViewMap; | ||
|
||
/// A [`GroupValues`] storing single column of Utf8View/BinaryView values | ||
/// | ||
/// This specialization is significantly faster than using the more general | ||
/// purpose `Row`s format | ||
pub struct GroupValuesBytesView { | ||
/// Map string/binary values to group index | ||
map: ArrowBytesViewMap<usize>, | ||
/// The total number of groups so far (used to assign group_index) | ||
num_groups: usize, | ||
} | ||
|
||
impl GroupValuesBytesView { | ||
pub fn new(output_type: OutputType) -> Self { | ||
Self { | ||
map: ArrowBytesViewMap::new(output_type), | ||
num_groups: 0, | ||
} | ||
} | ||
} | ||
|
||
impl GroupValues for GroupValuesBytesView { | ||
fn intern( | ||
&mut self, | ||
cols: &[ArrayRef], | ||
groups: &mut Vec<usize>, | ||
) -> datafusion_common::Result<()> { | ||
assert_eq!(cols.len(), 1); | ||
|
||
// look up / add entries in the table | ||
let arr = &cols[0]; | ||
|
||
groups.clear(); | ||
self.map.insert_if_new( | ||
arr, | ||
// called for each new group | ||
|_value| { | ||
// assign new group index on each insert | ||
let group_idx = self.num_groups; | ||
self.num_groups += 1; | ||
group_idx | ||
}, | ||
// called for each group | ||
|group_idx| { | ||
groups.push(group_idx); | ||
}, | ||
); | ||
|
||
// ensure we assigned a group to for each row | ||
assert_eq!(groups.len(), arr.len()); | ||
Ok(()) | ||
} | ||
|
||
fn size(&self) -> usize { | ||
self.map.size() + std::mem::size_of::<Self>() | ||
} | ||
|
||
fn is_empty(&self) -> bool { | ||
self.num_groups == 0 | ||
} | ||
|
||
fn len(&self) -> usize { | ||
self.num_groups | ||
} | ||
|
||
fn emit(&mut self, emit_to: EmitTo) -> datafusion_common::Result<Vec<ArrayRef>> { | ||
// Reset the map to default, and convert it into a single array | ||
let map_contents = self.map.take().into_state(); | ||
|
||
let group_values = match emit_to { | ||
EmitTo::All => { | ||
self.num_groups -= map_contents.len(); | ||
map_contents | ||
} | ||
EmitTo::First(n) if n == self.len() => { | ||
self.num_groups -= map_contents.len(); | ||
map_contents | ||
} | ||
EmitTo::First(n) => { | ||
// if we only wanted to take the first n, insert the rest back | ||
// into the map we could potentially avoid this reallocation, at | ||
// the expense of much more complex code. | ||
// see https://github.com/apache/datafusion/issues/9195 | ||
let emit_group_values = map_contents.slice(0, n); | ||
let remaining_group_values = | ||
map_contents.slice(n, map_contents.len() - n); | ||
|
||
self.num_groups = 0; | ||
let mut group_indexes = vec![]; | ||
self.intern(&[remaining_group_values], &mut group_indexes)?; | ||
|
||
// Verify that the group indexes were assigned in the correct order | ||
assert_eq!(0, group_indexes[0]); | ||
|
||
emit_group_values | ||
} | ||
}; | ||
|
||
Ok(vec![group_values]) | ||
} | ||
|
||
fn clear_shrink(&mut self, _batch: &RecordBatch) { | ||
// in theory we could potentially avoid this reallocation and clear the | ||
// contents of the maps, but for now we just reset the map from the beginning | ||
self.map.take(); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters