In a message dated 2/14/2004 3:00:49 PM Pacific Standard Time,
[EMAIL PROTECTED] writes:
> Is that one similiar to the 'only' one available to native systems, which
> many people have known for years?
>
The native Pick algorithm was published twenty years ago by Ultimate.
It's in the public do
: 13 February 2004 17:32
To: 'U2 Users Discussion List'
Subject: RE: Hashing Algorithm
Chuck ,
I am a Business Partner of IBM in Mexico, and I sell U2 products since 1992
with VMark, The Wish to know how the algorithm works for each file type is
to be able to help one of my customers that
des all the people who went on courses run by Informix,
Ardent, VMARK et al...
Cheers,
Wol
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of [EMAIL PROTECTED]
Sent: 14 February 2004 15:46
To: [EMAIL PROTECTED]
Subject: Re: Hashing Algorithm
In a message date
It's not one, it's all 19 of them (types 2 through 18 and two for type 30).
The Type 18 algorithm is closest to the "Pick" hashing algorithm.
- Original Message -
From: "Mark Johnson" <[EMAIL PROTECTED]>
Date: Sat, 14 Feb 2004 18:00:26 -0500
To
uary 14, 2004 5:06 PM
Subject: Re: Hashing Algorithm
> It might be interesting if someone were to publish the "Ardent" hashing
algorithms, then. ;)
> Not something I'm prepared to risk doing, however.
>
> - Original Message -
> From: [EMAIL PROTECTED]
> Date: S
It might be interesting if someone were to publish the "Ardent" hashing algorithms,
then. ;)
Not something I'm prepared to risk doing, however.
- Original Message -
From: [EMAIL PROTECTED]
Date: Sat, 14 Feb 2004 10:45:45 EST
To: [EMAIL PROTECTED]
Subject: Re: Hashing Algo
In a message dated 2/13/2004 6:18:30 AM Pacific Standard Time,
[EMAIL PROTECTED] writes:
> I have the algorithms (from a legal source long before IBM acquired the
> product) but because they are now secret I cannot divulge the details. They
> are, however, extremely simple except for the dynami
What about using FAST?
Eugene
- Original Message -
From: "José Luis Gutiérrez de la Peza" <[EMAIL PROTECTED]>
To: "'U2 Users Discussion List'" <[EMAIL PROTECTED]>
Sent: Friday, February 13, 2004 10:31 AM
Subject: RE: Hashing Algorithm
>
mance, after he
used the HASH.HELP as a guide for the last 4 years.
Jose Luis
-Mensaje original-
De: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] En
nombre de Chuck Mongiovi
Enviado el: viernes, 13 de febrero de 2004 8:30
Para: U2 Users Discussion List
Asunto: RE: Hashing Algorithm
> I
: [EMAIL PROTECTED]
Asunto: RE: Hashing Algorithm
>>> [EMAIL PROTECTED] 02/13/2004 8:49:08 AM >>>
> > Could anyone let me know where can I found information about
> > the way the Hash Algorithm Works with each one of the File Types
> > in UniVerse?
> It does, of
> I used to have a program I calledthat would take a select list &
> sort it according to the group order of the file it was going to be
> applied to. For really big lists it made a really big difference
What a great idea!
> I wish IBM would give us a similar function
On UniData you can use
> When HASH.HELP became robust enough I quit using my program as I couldn't
> justify the development time/effort. Instead I wrote a front-end which
> generated paragraphs consisting primarily of HASH.HELP %filename%
> statements. The paragraphs included COMO statements, and the final
> statement
> It does, of course, lead to the question of why you want to know!
I used to have a program I calledthat would take a select list &
sort it according to the group order of the file it was going to be
applied to. For really big lists it made a really big difference
because subsequent file i/o
From: "Karjala Koponen" <[EMAIL PROTECTED]>
> Would knowing the algorithms allow you to write a program that would
accept parameters about your file, or > even walk the file, to determine
which file type would be best for that file?
Years ago I wrote a FTN program that analyzed PR1ME INFORMATIO
>>> [EMAIL PROTECTED] 02/13/2004 8:49:08 AM >>>
> > Could anyone let me know where can I found information about
> > the way the Hash Algorithm Works with each one of the File Types
> > in UniVerse?
> It does, of course, lead to the question of why you want to know!
Would knowing the algorithms
> I have the algorithms
> (from a legal source long before IBM acquired the product)
> I cannot divulge the details
I wasn't suggesting anything like that .. I know the legalities of a
situation sometimes get in the way of the fun of it .. I was just suggesting
that Jose might not have any shady i
> Why not? .. I'd bet on simple (or not so simple) curiousity .. Aren't we
all
> pretty much tech geeks here? .. Maybe he wants to see the hashing
> mathematics for himself and then check out a high speed data structures
book
> and see if they're all they're cracked up to be ..
I have the algorith
> > Could anyone let me know where can I found information about
> > the way the Hash Algorithm Works with each one of the File Types
> > in UniVerse?
> It does, of course, lead to the question of why you want to know!
Why not? .. I'd bet on simple (or not so simple) curiousity .. Aren't we all
p
> Could anyone let me know where can I found information about
> the way the Hash Algorithm Works with each one of the File Types
> in UniVerse?
As Ray says, these are no longer considered to be public. However, the
dynamic file algorithms come straight out of a computing text book and it is
not
nals"
class, I think you will be out of luck.
- Original Message -
From: José Luis Gutiérrez de la Peza <[EMAIL PROTECTED]>
Date: Thu, 12 Feb 2004 13:18:59 -0600
To: <[EMAIL PROTECTED]>
Subject: Hashing Algorithm
> Could anyone let me know where can I found information
Could anyone let me know where can I found information about the way the
Hash Algorithm Works with each one of the File Types in UniVerse?
Thanks in advance
ABDP
José Luis Gutiérrez de la Peza
Director General
Asesores en Bases de Datos Profesionales, S.A. de C.V.
Tel. (52) 55-59-12-44 y/o (52)
21 matches
Mail list logo
