Oleg Utkin

Made the [benchmark](https://github.com/apache/arrow-datafusion/pull/7948). [Here are the results.](https://github.com/apache/arrow-datafusion/pull/7870#issuecomment-1782873654)

> Is there a reason to use a b-tree ( O(log⁡n) ) vs a hash map ( O(1) )? Using b-tree we can query all fields matching to a "prefix"...

Made a [benchmark](https://github.com/apache/arrow-datafusion/pull/7948). ## Baseline - Data Fusion 32 (a0c5affca271d67980286cb2ae08ea8eec75a326) ``` index_of_column_by_name 10 time: [11.323 ns 11.325 ns 11.328 ns] change: [-0.0714% +0.3045% +0.6180%] (p = 0.09 > 0.05) No...