Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Building a hash of employees.

by rdfield (Priest)
on Jul 02, 2003 at 09:30 UTC ( [id://270747]=note: print w/replies, xml ) Need Help??


in reply to Building a hash of employees.

MDBLM (or any other tied hash) is what you need for persistence when you're only searching via the firstname (how long before you'll have to come up with a scheme to store multiple occurances of the same first name?), but what happens when you're looking for people with a particular skill or in a particular telephone area code? To future-proof this structure you'll need an SQL database.

rdfield

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (10)
As of 2024-04-23 08:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found