[AccessD] checkbox concatenation

...and a further comment:

If the table was growing *logarithmically*, William would be delighted!  The
problem is that it is growing *geometrically*.

Reading the Cache doc, a bitmap index may just do the trick, especially as
the max number of events is probably not that large.
Since this is a sparse array problem, it may also work well with an R-tree
(as found in PostgreSQL). 

Jim

-----Original Message-----
From: accessd-bounces at databaseadvisors.com
[mailto:accessd-bounces at databaseadvisors.com] On Behalf Of Gustav Brock
Sent: Tuesday, October 31, 2006 9:10 AM
To: accessd at databaseadvisors.com
Subject: Re: [AccessD] checkbox concatenation

Hi William

That would require an engine capable of bit-mapped indexing and searching.
At least one can do this, InterSystems Caché:

http://www.intersystems.com/cache/

http://www.intersystems.com/cache/technology/components/bitmap/index.html 

/gustav

>>> wdhindman at dejpolsystems.com 31-10-2006 15:47:51 >>>
...given four tables

   tblContact pk ContactID fk CompanyId
   tblCompany pk CompanyID
   tbEvent pk EventID
   tblEventReg pkERID fk EventID fk CompanyD fk ContactID

...tblEventRegistration is a join table to show which contacts from which
companies attended which events.
...given that thousands of contacts attend each event, tblEventReg is
growing logarithmically

Q: is it feasible to use a numeric field in the tblContacts to replace
tblEventReg by using event checkboxes instead, assigning them a numeric
value by show and then mathematically summing them in the numeric field
...thus using one integer to represent every event attended by that contact?

...yes/no? ...pros/cons?

William Hindman 

--
AccessD mailing list
AccessD at databaseadvisors.com
http://databaseadvisors.com/mailman/listinfo/accessd
Website: http://www.databaseadvisors.com