MatchCombinations_2K.mdb |
Post Reply |
Author | |
A.D. Tejpal
Microsoft MVP Joined: 30 Jun 2008 Status: Offline Points: 192 |
Post Options
Thanks(0)
Posted: 08 Jul 2008 at 10:34pm |
This is an exercise in matching largest possible combinations of positive and negative values for a given field in the database so that their values offset each other. This information is relevant to certain systems of book keeping. In order to achieve best results, at the same time avoiding unaffordable slowing down in processing each and every possible combination (the number of theoretically possible combinations can become astronomically huge as the total number of records in the database increases), following sort sequence is adopted for positive and negative values before computing their running sums, which in turn are subjected to cartesian comparison - (a) Pos Asc, Neg Asc (b) Pos Asc, Neg Desc (a) Pos Desc, Neg Asc (a) Pos Desc, Neg Desc (a) Pos Random, Neg Random
|
|
Sponsored Links | Want a good read? Try The Summer of His Life (available on Amazon!) |
Post Reply | |
Tweet
|
Forum Jump | Forum Permissions You cannot post new topics in this forum You cannot reply to topics in this forum You cannot delete your posts in this forum You cannot edit your posts in this forum You cannot create polls in this forum You cannot vote in polls in this forum |