Print Page | Close Window


Printed From: Roger's Access Library
Category: Other Download Libraries
Forum Name: Tejpal, A.D.
Forum Description: A.D. Tejpal's Library
Printed Date: 21 Jul 2018 at 3:37pm

Topic: MatchCombinations_2K.mdb
Posted By: A.D. Tejpal
Subject: MatchCombinations_2K.mdb
Date 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

Download Access 2000: - uploads/37/


Email: -

Print Page | Close Window