In message <[EMAIL PROTECTED]>, Andrew McLean wrote:
> I have the ability to query a database in a legacy system and extract
> records which match a particular pattern. Specifically, I can perform
> queries for records that contain a given search term as a sub-string of
> a particular column.
Wha
Gabriel Genellina wrote:
> This is known as a "set cover" algorithm. You have a set of subsets,
> and want to determine the smallest set of those subsets, whose union
> is the universal set - (uh, what a mess!)
I thought of that too, but he seems to be adding a second desired
property: the inters
At Thursday 14/9/2006 20:31, Andrew McLean wrote:
Now I want to issue a series of queries, such that when I combine all
the data returned I have accessed all the records in the database.
However, I want to minimise the total number of queries and also want to
keep the number of records returned
Andrew McLean wrote:
> Now I want to issue a series of queries, such that when I combine all
> the data returned I have accessed all the records in the database.
> However, I want to minimise the total number of queries and also want to
> keep the number of records returned by more than one query
John Machin wrote:
> A quick silly question: what is the problem that you are trying to
> solve?
A fair question :-)
The problem may seem a bit strange, but here it is:
I have the ability to query a database in a legacy system and extract
records which match a particular pattern. Specifically,
Andrew McLean wrote:
> Carl Banks wrote:
> > Andrew McLean wrote:
> >> I have a list of strings, A. I want to find a set of strings B such that
> >> for any "a in A" there exists "b in B" such that b is a sub-string of a.
> >
> > B=A?
> >
> >> But I also want to minimise T = sum_j t_j where
> >> t
Carl Banks wrote:
> Andrew McLean wrote:
>> I have a list of strings, A. I want to find a set of strings B such that
>> for any "a in A" there exists "b in B" such that b is a sub-string of a.
>
> B=A?
>
>> But I also want to minimise T = sum_j t_j where
>> t_j = count of the number of elements i
Andrew McLean wrote:
> I have a list of strings, A. I want to find a set of strings B such that
> for any "a in A" there exists "b in B" such that b is a sub-string of a.
B=A?
> But I also want to minimise T = sum_j t_j where
> t_j = count of the number of elements in A which have b[j] as a sub-s
On 2006-09-10, Andrew McLean <[EMAIL PROTECTED]> wrote:
> This really an algorithm question more that a Python question,
> but it would be implemented in Python
In that case, try comp.programming. But still...
> I have a list of strings, A. I want to find a set of strings B
> such that for a
