[ARROW-5898] [Java] Provide functionality to efficiently compute hash code for arbitrary memory segment

• Type: New Feature
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 0.15.0
• Component/s: Java
• Labels: pull-request-available
• External issue URL: https://github.com/apache/arrow/issues/22311
• Assignee: Liya Fan
• Reporter: Liya Fan
• Created: 10/Jul/19 08:20
• Updated: 11/Jan/23 07:43
• Resolved: 24/Jul/19 04:37

Description

This issue adds a functionality to efficiently compute  the hash code for a consecutive memory region. This functionality is important in practical scenarios because it helps:

• Avoid unnecessary memory copy.

• Avoid repeated conversions between Java objects & Arrow buffers. 

Since the algorithm for calculating hash code has  significant performance implications, we need to design an interface so that different algorithms can be easily introduces as plug-ins.

Issue Links

• links to: GitHub Pull Request #4844