Re: Using C# to insert blob into Oracle

From: Nicholas Paldino [.NET/C# MVP] (mvp_at_spam.guard.caspershouse.com)
Date: 03/15/05 

Date: Tue, 15 Mar 2005 11:15:35 -0500

Chris,

    The provider for Oracle should represent the field as a byte array. You
should be able to assign a new byte array to this field in a data set, and
then update the field through an ad-hoc query or stored procedure, just like
you would any other value in the database.

    Hope this helps. 

-- 
               - Nicholas Paldino [.NET/C# MVP]
               - mvp@spam.guard.caspershouse.com
"Chris Fink" <chris.fink@gmail.com> wrote in message 
news:OoGdgjXKFHA.3340@TK2MSFTNGP14.phx.gbl...
>I have setup an Oracle table which contains a blob field.  How do I insert
> data into this field using C# and ADO.net?
>
>

Relevant Pages

  • Re: Returning complex data relationships from a stored procedure.
    ... There isn't any automatic process to handle this. ... your stored procedure should return two result ... Then, on the client side, use the data set designer to create the typed ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Multiple Matrix calculations from data list
    ... The first determinant would be =MDETERM= 4 ... For the second data set, I would increment the matrix array by 1: ... columns of the square matrix you want to build. ...
    (microsoft.public.excel.misc)
  • Re: 2 DATA GRID Questions
    ... I have never written stored procedures. ... So I should write a stored procedure with 7 select statements. ... use this stored procedure with only one data adapter & 1 data set. ... > private void BindData ...
    (microsoft.public.dotnet.general)
  • Re: Creating datagrid view from an two-dimensional array
    ... > Nicholas Paldino wrote:>> mirek, ... While Array implements IList, the grid will reflect>> on the properties of each value in the array, which in turn are another>> array. ... >> Your other option is to create a data set, and populate it manually,>> and then bind to that. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Sorting an array. Fastest way.
    ... A TreeMap, which implements a red-black balanced binary tree, will give reasonable performance with any size of data set. ... Its performance isn't degraded by loading pre-ordered data: this is a problem with simple unbalanced binary tree algorithms. ... Operations on a TreeMap won't be as fast as on an array, but they don't degrade badly for a small dataset and do become spectacularly fast for extremely large data sets. ... The only drawback is that an amendment that changes the key MUST be a deletion followed by an insert to maintain the tree's ordering, so an amendment will take approximately twice as long as a search. ...
    (comp.lang.java.programmer)