Search results

I printed everything out and sat down with it all over lunch, made a lot more sense when I could really compare everything at the same time :) also I'd never really thought about it as logic gates, or about how a result part way down could be effectively reached by a single statement. I think I...

I got kinda lost in the postit discription, I've attached a kinda sketchy visio drawing of the logic "Tree" I need to code, let me know what you think, Back to the postit's - by Nodes do you mean what i've labeled A B C D E etc? and the Branches are the lines? so the postit's are mean to have...

Err, that's where I get stuck! what do you mean by: "then in Diagram 1 some of the nodes you get to (after a "rejoin") , are just the the same ones for all paths to them." After a rejoin can I get to the same line of code from multiple paths? Or just a logically identical duplicate?

This is what I'm trying to do, get to the same question (e.g: "IF" statement in my program) by taking different routes through the logic before it :)

So when writing code I need to think of it like this: "In the second diagram that would be depicted by some branches being entirely similar" Instead of the over simplified diagram where "here depicted as the same physical leaf - via different paths" ?

I have a logic tree, but I can't express it in code? The problem is some branches of the tree rejoin further down! Maybe these two images from google explain it better: What i'm trying to do looks like this, see how the true's feed back into each other on the left...

Gemma - I hope that the quote definitely only applies to backwards searches then! lol :) There's a few thousand records in the table and it'll need to seek ~200k times. Seek was definitely chosen for speed! :) So as long as I can use two indexes in DAO I'm ok (is this possible?) I'd need to...

oh, fair enough, i've already been declaring indexes for other Seeks so i should just be able to do that as well, wonder if i can have two indexes? (one for the sort and one for the seek) think i might just have to set it up and do some testing! cheers for the help, if anyone else knows of any...

That's no problem, i'm only selecting * from a single table, The only reason i was going to use SQL is that I was told even a table made by a "Make Table" query with a sort set, would not in fact be sorted, and that I should use a query when opening the recordset to achieve this, but it makes...

I need to seek on a non unique index, I have set the order with a select when I've opened the recordset, does seek definitely find the first occurance when using "=" ? Because the above statement has me worried! I'm not searching backwards, but, can a start to finish seek be relied upon to...

Can I use tabledef in DAO to get around this? Also I can't really control how many decimals will be needed, what's the limit on decimal?

I'm running a couple of Make Table queries based on ODBC imported tables, doing stuff to the data then writing it back. However I had issues as the make table seems to make Decimals, not Doubles and I need more than 4 DP after calculations, however it seems doing a bit of logic causes Access...

I am using Access 2007 and VB to work on data from a Visual FoxPro 6 production management system, using ODBC so far I have not had many problems with numbers (at least not that we have noticed) How ever I have started working in some new areas where a lot of values are decimal, so using the...

Oh! I didn't realise I could just do that and still do the .Edit and .Update, I thought a query would be read only, I've also just had to disable the .Index I had used, but it doesn't seem to have effected performance, awesome :) Thanks again :)

I've got it! :) I went back to the recordset way, but avoided FindPrevious and made another table to store the subtotals (by adding an index and using .Seek i've got the runtime down to a few minutes from many hours) I also cleaned my code up a ton (I hope) Function Test1() Dim SubTotalSum...

I have just been doing a bit of speed testing with the select subqueries (using SUM, MAX and TOP) and they are all disappointingly slow :( the problem is the table (or query) is 200k records, so anything that looks at the whole table to find a top value (and then has to do it for the other...

right, i've made a basic subquery do a sum as part of a select query (i think i also had it doing Max ok, but as it wasn't updating the fields it was always finding 0, lol) i've just tried to turn the sum back into an update query and i get the same error?

ok, no worries, i'd rather use a query based on that table (as its quicker than a recordset), and roll down it in order with the query Yea, i see that bit, i need a Max not a Sum so that should be fine to swap? His uses some joins as thats how his data is, or are you saying the table HAS to be...

sorry, I feel like I'm being difficult but I'm just really confused So how should I proceed? (access does not support a recursive select query, a MakeTable followed by an Update with the table joined to itself work around this, but you say I shouldn't be using a table at all?) Allen's example...

I copied Allen's example and I'm having the same problem as when I messed about with subqueries before and when I've tried a totals query etc, my SQL for the main update is: UPDATE sndbasis SET sndbasis.Demand = [sndbasis].[requirement]+(SELECT Max(sndbasis.Demand) FROM sndbasis WHERE...