Re: Me know logical no need

This WebDNA talk-list message is from

2002


It keeps the original formatting.
numero = 41320
interpreted = N
texte = Maybe... I haven't ever played with the 'FULL' dataset yet.I need to redevelop our sites using a different database, and I'm just trying to conjure up ways to do things at this point. On 7/9/02 6:16 PM, Alain Russell mashed the following keys :> I would have thought anything you did with a 500 MB database would be slow > .. ? > > > >> Right, this was my initial idea too, a second db. >> >> I get the entire DB daily, I never add records, it comes from the MLS. >> So a running total would require 300,000+ replaces. >> >> A second DB, ditto. >> >> I could do as suggested and search all agent's (15,523 of them) and then >> summarize the total, but, again, that's 1+ 15,523 searches :) >> >> I'm thinking that'll be slow. >> >> >> >> >> >> On 7/9/02 5:16 PM, Stuart Tremain mashed the following keys : >> >>> Or run a second db >>> -- >>> Stuart Tremain >>> idfk web developments - Australia >>> >>> On Wednesday, 10 July 2002, Robert Wade wrote: >>>> Would it be possible for you to add a field to the database that would keep >>>> a >>>> running total for each realtor. Every time a listing is added you look at >>>> the last >>>> running_total field in the listing for that agent, then add the cost of >>>> the >>>> new >>>> one to that total and stick it in the new listing's field. Since all the >>>> entries >>>> are added into the database chronologically, it would then be simple to do >>>> a >>>> summarized agentID search by most recent date to figure out who has the >>>> highest >>>> running_total. You could total up each agents entries as of now, and >>>> enter >>>> that >>>> into the last entries running_total field for that agent. No need to go >>>> back and >>>> do the math for each entry, since all you need is a total, then the script >>>> would >>>> take care of it from here. >>>> >>>> Just a thought... RW >>>> >>>> Andrew Simpson wrote: >>>> >>>>> Do you have SQL Server handy??? >>>>> >>>>> Wouldn't try this in webcat >>>>> >>>>> On 10/7/02 11:49 AM, Aaron Lynch wrote: >>>>> >>>>>> I need some advice on the best way to approach this task, I just can't >>>>>> seem >>>>>> to wrap my tiny mind around the concepts needed... >>>>>> >>>>>> >>>>>> I have a large real estate DB, currently 35 megs but when this project is >>>>>> done it will be 500 Megs in size. (every house sold in Seattle for a >>>>>> year) >>>>>> >>>>>> I want to find the top 20 listing agents, so for example, the db looks >>>>>> something like: >>>>>> >>>>>> AgentID price >>>>>> AgentID price >>>>>> AgentID price >>>>>> >>>>>> I think to find the agents with the most actual listings would be easy >>>>>> using >>>>>> allhit=1&max=20 (right?) >>>>>> >>>>>> but, to find who has the most dollar volume, do I need to search all >>>>>> listings, summarize all the agents, search all the agents, do math into a >>>>>> temp DB to get a total, and then search the temp DB by total? or is there >>>>>> (please dear god) an easier way? the full db will be several hundred >>>>>> thousand records, each 130 or so fields wide. >>>>>> >>>>>> >>>>>> ------------------------------------------------------------- >>>>>> This message is sent to you because you are subscribed to >>>>>> the mailing list . >>>>>> To unsubscribe, E-mail to: >>>>>> To switch to the DIGEST mode, E-mail to >>>>>> >>>>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>>> >>>>> -- >>>>> >>>>> Andrew Simpson >>>>> Web Development >>>>> >>>>> Blackpepper Interactive Ltd >>>>> PO Box 99805 >>>>> Newmarket >>>>> >>>>> 4 Clayton Street >>>>> Newmarket >>>>> Auckland >>>>> >>>>> Ph: +64 9 520-6281 >>>>> Mob: 0272733270 >>>>> Fax: +64 9 524-1849 >>>>> >>>>> http://www.blackpepper.co.nz >>>>> >>>>> ------------------------------------------------------------- >>>>> This message is sent to you because you are subscribed to >>>>> the mailing list . >>>>> To unsubscribe, E-mail to: >>>>> To switch to the DIGEST mode, E-mail to >>>>> >>>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>> >>>> -- >>>> >>>> ================================================ >>>> Robert Wade >>>> Outbound Creative, Inc. >>>> robert@outboundcreative.com >>>> ================================================ >>>> |[ ] L|| ‘||‘ ||} |[ ] L|| ||\| ||) >>>> ================================================ >>>> >>>> >>>> >>>> ------------------------------------------------------------- >>>> This message is sent to you because you are subscribed to >>>> the mailing list . >>>> To unsubscribe, E-mail to: >>>> To switch to the DIGEST mode, E-mail to >>>> >>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>> >>> >>> >>> >>> ------------------------------------------------------------- >>> This message is sent to you because you are subscribed to >>> the mailing list . >>> To unsubscribe, E-mail to: >>> To switch to the DIGEST mode, E-mail to >>> >>> Web Archive of this list is at: http://search.smithmicro.com/ >> >> >> ------------------------------------------------------------- >> This message is sent to you because you are subscribed to >> the mailing list . >> To unsubscribe, E-mail to: >> To switch to the DIGEST mode, E-mail to >> >> Web Archive of this list is at: http://search.smithmicro.com/ > > > ------------------------------------------------------------- > This message is sent to you because you are subscribed to > the mailing list . > To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to > > Web Archive of this list is at: http://search.smithmicro.com/ ------------------------------------------------------------- This message is sent to you because you are subscribed to the mailing list . To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Associated Messages, from the most recent to the oldest:

    
  1. Re: SOLUTION? Re: Me know logical no need (John Peacock 2002)
  2. Re: SOLUTION? Re: Me know logical no need (Jesse Williams-Proudman 2002)
  3. Re: SOLUTION? Re: Me know logical no need (John Peacock 2002)
  4. Re: SOLUTION? Re: Me know logical no need (Brian Fries 2002)
  5. SOLUTION? Re: Me know logical no need (Joseph D'Andrea 2002)
  6. Re: Me know logical no need (Dan Strong 2002)
  7. Re: Me know logical no need (Michael Davis 2002)
  8. Re: Me know logical no need (Aaron Lynch 2002)
  9. Re: Me know logical no need (Michael Davis 2002)
  10. Re: Me know logical no need Now totally OT (Aaron Lynch 2002)
  11. Re: Me know logical no need (Glenn Busbin 2002)
  12. Re: Me know logical no need (Aaron Lynch 2002)
  13. Re: Me know logical no need (Andrew Simpson 2002)
  14. Re: Me know logical no need (Alain Russell 2002)
  15. Re: Me know logical no need (Kenneth Grome 2002)
  16. Re: Me know logical no need (Aaron Lynch 2002)
  17. Re: Me know logical no need (Andrew Simpson 2002)
  18. Re: Me know logical no need (Aaron Lynch 2002)
  19. Re: Me know logical no need (Glenn Busbin 2002)
  20. Re: Me know logical no need (Aaron Lynch 2002)
  21. Re: Me know logical no need (Andrew Simpson 2002)
  22. Re: Me know logical no need (Kenneth Grome 2002)
  23. Re: Me know logical no need (Kenneth Grome 2002)
  24. Re: Me know logical no need (Aaron Lynch 2002)
  25. Re: Me know logical no need (Stuart Tremain 2002)
  26. Re: Me know logical no need (Aaron Lynch 2002)
  27. Re: Me know logical no need (Aaron Lynch 2002)
  28. Re: Me know logical no need (Jesse Williams-Proudman 2002)
  29. Re: Me know logical no need (Jesse Williams-Proudman 2002)
  30. Re: Me know logical no need (Alain Russell 2002)
  31. Re: Me know logical no need (Glenn Busbin 2002)
  32. Re: Me know logical no need (Aaron Lynch 2002)
  33. Re: Me know logical no need (Stuart Tremain 2002)
  34. Re: Me know logical no need (Robert Wade 2002)
  35. Re: Me know logical no need (Alain Russell 2002)
  36. Re: Me know logical no need (Andrew Simpson 2002)
  37. Me know logical no need (Aaron Lynch 2002)
Maybe... I haven't ever played with the 'FULL' dataset yet.I need to redevelop our sites using a different database, and I'm just trying to conjure up ways to do things at this point. On 7/9/02 6:16 PM, Alain Russell mashed the following keys :> I would have thought anything you did with a 500 MB database would be slow > .. ? > > > >> Right, this was my initial idea too, a second db. >> >> I get the entire DB daily, I never add records, it comes from the MLS. >> So a running total would require 300,000+ replaces. >> >> A second DB, ditto. >> >> I could do as suggested and search all agent's (15,523 of them) and then >> summarize the total, but, again, that's 1+ 15,523 searches :) >> >> I'm thinking that'll be slow. >> >> >> >> >> >> On 7/9/02 5:16 PM, Stuart Tremain mashed the following keys : >> >>> Or run a second db >>> -- >>> Stuart Tremain >>> idfk web developments - Australia >>> >>> On Wednesday, 10 July 2002, Robert Wade wrote: >>>> Would it be possible for you to add a field to the database that would keep >>>> a >>>> running total for each realtor. Every time a listing is added you look at >>>> the last >>>> running_total field in the listing for that agent, then add the cost of >>>> the >>>> new >>>> one to that total and stick it in the new listing's field. Since all the >>>> entries >>>> are added into the database chronologically, it would then be simple to do >>>> a >>>> summarized agentID search by most recent date to figure out who has the >>>> highest >>>> running_total. You could total up each agents entries as of now, and >>>> enter >>>> that >>>> into the last entries running_total field for that agent. No need to go >>>> back and >>>> do the math for each entry, since all you need is a total, then the script >>>> would >>>> take care of it from here. >>>> >>>> Just a thought... RW >>>> >>>> Andrew Simpson wrote: >>>> >>>>> Do you have SQL Server handy??? >>>>> >>>>> Wouldn't try this in webcat >>>>> >>>>> On 10/7/02 11:49 AM, Aaron Lynch wrote: >>>>> >>>>>> I need some advice on the best way to approach this task, I just can't >>>>>> seem >>>>>> to wrap my tiny mind around the concepts needed... >>>>>> >>>>>> >>>>>> I have a large real estate DB, currently 35 megs but when this project is >>>>>> done it will be 500 Megs in size. (every house sold in Seattle for a >>>>>> year) >>>>>> >>>>>> I want to find the top 20 listing agents, so for example, the db looks >>>>>> something like: >>>>>> >>>>>> AgentID price >>>>>> AgentID price >>>>>> AgentID price >>>>>> >>>>>> I think to find the agents with the most actual listings would be easy >>>>>> using >>>>>> allhit=1&max=20 (right?) >>>>>> >>>>>> but, to find who has the most dollar volume, do I need to search all >>>>>> listings, summarize all the agents, search all the agents, do math into a >>>>>> temp DB to get a total, and then search the temp DB by total? or is there >>>>>> (please dear god) an easier way? the full db will be several hundred >>>>>> thousand records, each 130 or so fields wide. >>>>>> >>>>>> >>>>>> ------------------------------------------------------------- >>>>>> This message is sent to you because you are subscribed to >>>>>> the mailing list . >>>>>> To unsubscribe, E-mail to: >>>>>> To switch to the DIGEST mode, E-mail to >>>>>> >>>>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>>> >>>>> -- >>>>> >>>>> Andrew Simpson >>>>> Web Development >>>>> >>>>> Blackpepper Interactive Ltd >>>>> PO Box 99805 >>>>> Newmarket >>>>> >>>>> 4 Clayton Street >>>>> Newmarket >>>>> Auckland >>>>> >>>>> Ph: +64 9 520-6281 >>>>> Mob: 0272733270 >>>>> Fax: +64 9 524-1849 >>>>> >>>>> http://www.blackpepper.co.nz >>>>> >>>>> ------------------------------------------------------------- >>>>> This message is sent to you because you are subscribed to >>>>> the mailing list . >>>>> To unsubscribe, E-mail to: >>>>> To switch to the DIGEST mode, E-mail to >>>>> >>>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>> >>>> -- >>>> >>>> ================================================ >>>> Robert Wade >>>> Outbound Creative, Inc. >>>> robert@outboundcreative.com >>>> ================================================ >>>> |[ ] L|| ‘||‘ ||} |[ ] L|| ||\| ||) >>>> ================================================ >>>> >>>> >>>> >>>> ------------------------------------------------------------- >>>> This message is sent to you because you are subscribed to >>>> the mailing list . >>>> To unsubscribe, E-mail to: >>>> To switch to the DIGEST mode, E-mail to >>>> >>>> Web Archive of this list is at: http://search.smithmicro.com/ >>>> >>> >>> >>> >>> ------------------------------------------------------------- >>> This message is sent to you because you are subscribed to >>> the mailing list . >>> To unsubscribe, E-mail to: >>> To switch to the DIGEST mode, E-mail to >>> >>> Web Archive of this list is at: http://search.smithmicro.com/ >> >> >> ------------------------------------------------------------- >> This message is sent to you because you are subscribed to >> the mailing list . >> To unsubscribe, E-mail to: >> To switch to the DIGEST mode, E-mail to >> >> Web Archive of this list is at: http://search.smithmicro.com/ > > > ------------------------------------------------------------- > This message is sent to you because you are subscribed to > the mailing list . > To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to > > Web Archive of this list is at: http://search.smithmicro.com/ ------------------------------------------------------------- This message is sent to you because you are subscribed to the mailing list . To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Aaron Lynch

DOWNLOAD WEBDNA NOW!

Top Articles:

Talk List

The WebDNA community talk-list is the best place to get some help: several hundred extremely proficient programmers with an excellent knowledge of WebDNA and an excellent spirit will deliver all the tips and tricks you can imagine...

Related Readings:

Sendmail Excel Attachment (2006) Help! WebCat2 bug (1997) WebCat2b14MacPlugIn - [include] doesn't hide the search string (1997) Dreamweaver MX (again) (2002) RE: [input] formating (1998) quantity minimum problem (1997) [WebDNA] [PROTECT] - Log Out (2011) Just Testing (1997) Smith Micro - no competition (2000) [WebDNA] TCPConnect assist (2016) [WebDNA] SHA-512 How To Do It (2014) WCS Newbie question (1997) [isfile] ? (1997) WebCat2b13MacPlugin - nested [xxx] contexts (1997) RE: Missing contexts on NT (1997) serial number generation (1997) Quit revisited (1997) Buying sans cart (1997) WebCatalog for Mac 2.0.1 Released (1997) Linebreaks and [writefile] (2003)