Re: How to persist and query a hash lookup in memory with Perl ?



jackposemsky@xxxxxxxxx wrote:
On Nov 28, 6:37 pm, Gunnar Hjalmarsson <nore...@xxxxxxxxx> wrote:
Jack wrote:
Hi I have a web application that needs to on an adhoc basis query a
hash lookup which should be persisted in memory - I have seen this
module "Persistent::Memory - A Persistent Class implemented using
Memory (RAM)" but I wanted to see if there was a much simpler
approach to taking a hash map and making it 'callable' while
persisted in memory using standard features not requiring a special
Perl module install..

Any thoughts would be appreciated.

Why not a tied hash? See e.g. "perldoc DB_File".

Hi and thank you however that looks too complex - just trying to put a
hash in memory, why is that so hard to do ? Is there a simpler way ?

If you aren't willing to install modules and you aren't willing to use the
ones that are (often) standard, then I guess the next option would be to
hire someone who is willing to do one of those things.

Xho

--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
.



Relevant Pages

  • Re: How to persist and query a hash lookup in memory with Perl ?
    ... hash lookup which should be persisted in memory - I have seen this ... Memory " but I wanted to see if there was a much simpler approach ... memory using standard features not requiring a special Perl module ... are only as good as the life of the execution of the script!! ...
    (comp.lang.perl.misc)
  • Re: How to persist and query a hash lookup in memory with Perl ?
    ... hash lookup which should be persisted in memory - I have seen this ... Memory " but I wanted to see if there was a much simpler approach ... memory using standard features not requiring a special Perl module ... The trick to achieving "persistence" between execution ...
    (comp.lang.perl.misc)
  • Re: hash table size
    ... talking about chess programming ideas and what they do rather than actually ... you can clear out the memory. ... Just a couple cycles per hash check. ... The amount of physical memory each user gets is likely to be somewhat ...
    (rec.games.chess.computer)
  • Re: hash table size
    ... Change all the hash keys so you get a new random value. ... This way old entries from the previous search (or uninitialized hash memory) ... It is true that doing an AND is faster than a modulo. ... If you are runing a chess program for a reason, ...
    (rec.games.chess.computer)
  • Re: Firewall vs. IPS - Differences now (ISS, Intrushield 2.1?)
    ... > You risk running out of memory. ... That's like saying "it's trivial to DoS Aho-Corasic if you know the ... DoS's and improvements via use of the Jenkins hash are most illuminating. ... > replacement policy gives the worst behavior since an attacker can flood ...
    (Focus-IDS)