[PR] perf(internal/hashing): build binary memo offsets in one pass [arrow-go]

["fallintoplace (via GitHub)" <gi...@apache.org>]

fallintoplace opened a new pull request, #1196:
URL: https://github.com/apache/arrow-go/pull/1196

   ## Summary
   
   * Build binary offsets with one linear pass over the values.
   * Keep full and subset offsets relative to the requested start.
   * Apply the same change to int32 and int64 offsets.
   
   ## Benchmarks
   
   Added benchmarks for full and subset copies with int32 and int64 offsets. The local runs use 1k and 100k unique values, plus empty and null values.
   
   The 100k-value cases were about 15% to 25% faster locally, with 0 allocs/op.
   
   ## Tests
   
   * `go test ./internal/hashing ./parquet/internal/encoding`
   * `go test -race ./internal/hashing`
   * Full package test run passed with the local Parquet test data checkout, excluding the CSV example that needs a separate Arrow CSV fixture.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: github-unsubscribe@arrow.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org

Re: [PR] perf(internal/hashing): build binary memo offsets in one pass [arrow-go]

["zeroshade (via GitHub)" <gi...@apache.org>]

zeroshade merged PR #1196:
URL: https://github.com/apache/arrow-go/pull/1196


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: github-unsubscribe@arrow.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org