Liya Fan created ARROW-5898:
-------------------------------
Summary: [Java] Provide functionality to efficiently compute hash
code for arbitrary memory segment
Key: ARROW-5898
URL: https://issues.apache.org/jira/browse/ARROW-5898
Project: Apache Arrow
Issue Type: New Feature
Components: Java
Reporter: Liya Fan
Assignee: Liya Fan
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 a plug-in.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
