Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Sharing data structures among http processes?

by TravelByRoad (Acolyte)
on Jun 28, 2001 at 18:45 UTC ( #92296=note: print w/ replies, xml ) Need Help??


in reply to Sharing data structures among http processes?

One technique that comes to mind is to stamp each record in the disk database as to when it was most recently changed, with the timestamp an indexed field.

When the server responds to a page request, it would first query the database for recently changed records (since the last page request by this process), weave them into the in-memory data structure before doing the requested query in-memory.

This approach would task the database server to maintain a consistent state among processes, with each process synchronizing its in-memory state with that consistent state on start of each page request response.

TbR


Comment on Re: Sharing data structures among http processes?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (7)
As of 2014-11-21 03:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (104 votes), past polls