[jira] [Resolved] (ACCUMULO-1836) mutation could take key-value pairs in put() to be more efficient

["Dominic Garguilo (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/ACCUMULO-1836?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Dominic Garguilo resolved ACCUMULO-1836.
----------------------------------------
    Resolution: Fixed

Closing as superseded by https://github.com/apache/accumulo/issues/1056

> mutation could take key-value pairs in put() to be more efficient
> -----------------------------------------------------------------
>
>                 Key: ACCUMULO-1836
>                 URL: https://issues.apache.org/jira/browse/ACCUMULO-1836
>             Project: Accumulo
>          Issue Type: Improvement
>            Reporter: Chris McCubbin
>            Priority: Minor
>
> 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:
> {code}
> m.put(key.getColumnFamily(), key.getColumnQualifier(), new ColumnVisibility(key.getColumnVisibility()), value);
> {code}
> 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 message was sent by Atlassian Jira
(v8.20.10#820010)