You are viewing a plain text version of this content. The canonical link for it is here.
Posted to github@arrow.apache.org by "ozgrakkurt (via GitHub)" <gi...@apache.org> on 2023/06/20 19:22:48 UTC

[GitHub] [arrow-rs] ozgrakkurt commented on issue #4213: Use optimized implementation of bloom filter

ozgrakkurt commented on issue #4213:
URL: https://github.com/apache/arrow-rs/issues/4213#issuecomment-1599377512

   @tustvold added benchmark against `parquet2` implementation [on the repo](https://github.com/ozgrakkurt/sbbf-rs) can you run it if you have time?
   
   I ran it on an aarch64 cpu and these are the results I get:
   ```
   INSERT
   parquet2 -> 76 ns
   sbbf-rs -> 3.5ns
   
   CONTAINS (this seems to be dominated by hashing time and dynamic dispatch in sbbf-rs, also seems like the compiler optimizes the code in parquet2 pretty well)
   parquet2 -> 3.4 ns
   sbbf-rs -> 2.8 ns
   
   CONTAINS (without hashing and dynamic-dispatch in sbbf-rs, requires modifying library a little specifically for aarch64 since all aarch64 cpus support `neon` SIMD instructions, don't want to release with this optimization since not sure if it is worth complicating the code)
   parquet2 -> 1.9 ns
   sbbf-rs -> 500 ps
   ```


-- 
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