-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part files
Well, it's a 'how long's a piece of string' type of question but we had
a requirement to archive old data from a heavily used file.
The file has several indices too many and is in use 24/7
This makes copy/delete a fairly heavy
] On Behalf Of Baker Hughes
Sent: 28 May 2009 16:06
To: u2-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part files
Very helpful Stuart (and Brian) thanks.
1 follow-up question: given your algorithm below, when you
edit or copy those records over, what does the key
Clear regards from Ft Worth,
-Baker
-Original Message-
From: owner-u2-us...@listserver.u2ug.org
[mailto:owner-u2-us...@listserver.u2ug.org] On Behalf Of Boydell, Stuart
Sent: Wednesday, May 27, 2009 7:34 PM
To: u2-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part
Of Brian Leach
Sent: Thursday, May 28, 2009 11:16 AM
To: u2-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part files
Hi Baker
Unless I misunderstand the question - it don't work like that :)
UniVerse uses the partitioning algorithm to determine which part file the
record goes
It's really useful for archiving if the key contains a date - build the
algorithm on the date in the key and have a separate partfile for each year
(or quarter or month - you get the idea),
When you want to archive old data you just drop the partfile concerned -
remembering to add new partfiles
-Original Message-
From: owner-u2-us...@listserver.u2ug.org
[mailto:owner-u2-us...@listserver.u2ug.org] On Behalf Of John Jenkins
Sent: Thursday, May 28, 2009 4:20 PM
To: u2-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part files
It's really useful for archiving
] On Behalf Of Boydell, Stuart
Sent: Wednesday, May 27, 2009 7:34 PM
To: u2-users@listserver.u2ug.org
Subject: RE: [U2] Best algorithm for UV part files
Well, it's a 'how long's a piece of string' type of question but we had
a requirement to archive old data from a heavily used file.
The file has
Hi Baker
Well as you probably know the partitioning needs to be based on the key, so
it depends upon what meaningful information you can store there in an
invariant way.
For example:
If they are coming from archive, do/could the keys have an originating date
component? If so, you can distribute
Well, it's a 'how long's a piece of string' type of question but we had
a requirement to archive old data from a heavily used file.
The file has several indices too many and is in use 24/7
This makes copy/delete a fairly heavy impact on the system and archiving
was always an issue.
The IDs in the
