Benchmark: Add rich testing cases for sort string(utf8)

arrow/benches/sort_kernel.rs

@@ -103,6 +103,36 @@ fn add_benchmark(c: &mut Criterion) {
         b.iter(|| bench_sort_to_indices(&arr, None))
     });
 
+    let arr = create_string_array_with_max_len::<i32>(2usize.pow(12), 0.0, 10);
+    c.bench_function("sort string[0-10] to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_max_len::<i32>(2usize.pow(12), 0.5, 10);
+    c.bench_function("sort string[0-10] nulls to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_max_len::<i32>(2usize.pow(12), 0.0, 100);
+    c.bench_function("sort string[0-100] to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_max_len::<i32>(2usize.pow(12), 0.5, 100);
+    c.bench_function("sort string[0-100] nulls to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array::<i32>(2usize.pow(12), 0.0);
+    c.bench_function("sort string[0-400] to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array::<i32>(2usize.pow(12), 0.5);
+    c.bench_function("sort string[0-400] nulls to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
     let arr = create_string_array_with_len::<i32>(2usize.pow(12), 0.0, 10);
     c.bench_function("sort string[10] to indices 2^12", |b| {
         b.iter(|| bench_sort_to_indices(&arr, None))
@@ -113,6 +143,26 @@ fn add_benchmark(c: &mut Criterion) {
         b.iter(|| bench_sort_to_indices(&arr, None))
     });
 
+    let arr = create_string_array_with_len::<i32>(2usize.pow(12), 0.0, 100);
+    c.bench_function("sort string[100] to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_len::<i32>(2usize.pow(12), 0.5, 100);
+    c.bench_function("sort string[100] nulls to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_len::<i32>(2usize.pow(12), 0.0, 1000);
+    c.bench_function("sort string[1000] to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
+    let arr = create_string_array_with_len::<i32>(2usize.pow(12), 0.5, 1000);
+    c.bench_function("sort string[1000] nulls to indices 2^12", |b| {
+        b.iter(|| bench_sort_to_indices(&arr, None))
+    });
+
     // This will generate string view arrays with 2^12 elements, each with a length fixed 10, and without nulls.
     let arr = create_string_view_array_with_fixed_len(2usize.pow(12), 0.0, 10);
     c.bench_function("sort string_view[10] to indices 2^12", |b| {

arrow/src/util/bench_util.rs

@@ -228,7 +228,7 @@ fn create_string_view_array_with_len_range_and_prefix(
 }
 
 /// Creates a random (but fixed-seeded) array of rand size with a given max size, null density and length
-fn create_string_array_with_max_len<Offset: OffsetSizeTrait>(
+pub fn create_string_array_with_max_len<Offset: OffsetSizeTrait>(
     size: usize,
     null_density: f32,
     max_str_len: usize,