Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^3: "Just use a hash": An overworked mantra?

by sundialsvc4 (Abbot)
on Nov 19, 2011 at 17:38 UTC ( #938988=note: print w/ replies, xml ) Need Help??


in reply to Re^2: "Just use a hash": An overworked mantra?
in thread "Just use a hash": An overworked mantra?

For this problem, in which the known solution-space is constrained to what can fit into a reasonably sized hash and in which the total number of records and data-streams also fits into memory ... a memory-based solution works just fine, and there is utterly no reason to trundle out n-digit numbers to “prove” your point.

My original comment, which I said even at that time was ancillary to the original discussion, is that there do exist other classes of problems which for various reasons do not lend themselves well to the “random-access based” (and to “memory-based”) approaches that might occur to you on first-blush.   This might not be one of those cases, but it does not invalidate the fact that such problems do exist.   In those problems, the incremental costs of virtual-memory activity become a death by a thousand cuts.   A fundamental change of approach in those cases transforms a process that runs for days, into one that runs in just a few hours.   I have seen it.   I have done it.   “Batch windows” are a reality for certain common business computing jobs.   Last year I worked on a system that processes more than a terabyte of new data, assimilated from hundreds of switching stations, every single day, and this was the change that gave them their system back.

I was really, really hoping that in this case you wouldn’t rush out once again to prove how smart you are.   Let alone, as so many times before, publicly and at my expense.   Enough.


Comment on Re^3: "Just use a hash": An overworked mantra?
Re^4: "Just use a hash": An overworked mantra?
by BrowserUk (Pope) on Nov 19, 2011 at 18:17 UTC
    For this problem, in which the known solution-space is constrained to what can fit into a reasonably sized hash and in which the total number of records and data-streams also fits into memory ... a memory-based solution works just fine,

    Ignoring the silly bit about "records and data-streams" fitting in memory. Exactly!

    My mother had a brilliant solution to the problem of grease stains on carpets that involved brown paper and an iron; but you don't see me trotting out here at random.

    there is utterly no reason to trundle out n-digit numbers to “prove” your point.

    Beg to differ. There was a reason.

    Your continued insistence to trot out the description of something that might prove to be a suitable to solution to some other problem at some other place and time gave me that reason.

    I was really, really hoping that in this case you wouldn’t rush out once again to prove how smart you are. Let alone, as so many times before, publicly and at my expense.

    The only smarts involved, is your exhibited lack thereof in posting inappropriate solutions to questions.

    The only expense involved, is the time wasted by recipients of your "wisdoms", as they chase down blind alleys following them.

    Enough.

    We found something we can agree on.


    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://938988]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2014-10-22 01:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (112 votes), past polls