You are viewing a plain text version of this content. The canonical link for it is here.
Posted to notifications@accumulo.apache.org by "DomGarguilo (via GitHub)" <gi...@apache.org> on 2023/03/02 19:38:30 UTC

[GitHub] [accumulo] DomGarguilo commented on issue #1056: Design API for creating mutations from key/value pairs

DomGarguilo commented on issue #1056:
URL: https://github.com/apache/accumulo/issues/1056#issuecomment-1452447638

   Closing https://issues.apache.org/jira/browse/ACCUMULO-1836 in favor of this ticket. Below is the description of the jira ticket in case it could be helpful:
   
   > Right now, if I have a key-value pair and I want to make an insert out of it, I have to do something like this:
   
   > m.put(key.getColumnFamily(), key.getColumnQualifier(), new ColumnVisibility(key.getColumnVisibility()), value);
   However, I believe this results in the data in the key being array copied twice which is pretty inefficient (profiling shows this to be a fairly significant portion of our running time on heavy ingest). Since I think exposing the byte arrays directly is not preferred, perhaps there could be a method Mutation.put(Key,Value) that efficiently re-uses the byte arrays. Maybe it assumes the rows are the same, or maybe it could have an option for checking that.


-- 
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: notifications-unsubscribe@accumulo.apache.org

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