Start a Conversation

Unsolved

This post is more than 5 years old

C

2765

November 24th, 2009 05:00

Centera Content Address calculation remotely

I like to store a content in Centera just in case it doesn´t previously exist, because I have this content far away from centera, so i have to find a solution to transmit to centera just the content not already stored. How could I do it? Calculating the Content Address of all the content before sending it to centera? What is the algorithm used to do it?
Thank you in advance.

2 Intern

 • 

136 Posts

November 24th, 2009 09:00

I suggest you refer to the API Reference Guide's section "Blob Handling Functions" and look under FPTag_BlobWrite. There is a section that talks about the ID Calculation and options that are available (one of them includes calculating the content address before data is sent to Centera) and some examples.

4 Posts

November 25th, 2009 01:00

But it´s always necessary to send the data to the Centera cluster, just to know if the content already exists, even using

myTag.BlobWrite(inputStream, FPLibraryConstants.

FP_OPTION_CLIENT_CALCID);

Is there any way for not sending the content to Centera? I mean, the algorithm used to check if the content exists, could that algorithm be used out of Centera, and give the results obtained to Centera to check if the content already exists?

2 Intern

 • 

417 Posts

November 25th, 2009 01:00

If you want to minimise network traffic and only send the content when it is not on the Centera then CLIENT_CALCID will do this. It calculates the blob address of the piece of content and only if sends it across the wire if the cluster responds that it does not already exist.

There are no client side SDK API calls that operate on blob addresses. These are internal to the Centera and comprise the use of MD5, SHA256 and proprietary information. The SDK API calls operate only on C-Clip Content Addresses and access the physical content via the Blob commands on the underlying Tag object(s) within the C-Clip.

No Events found!

Top