Search results for query: *

Mike Thanks for your suggestion - that is exactly what I was interested in. I guess I was a little reluctant to move away from the DBM because of the ease of updating and removing entries. My perl script iterates through all subdirectories under a base directory building an array of JPG's and...

rycamor Nope - the only info will be the path/filename and the caption details. I'm not certain whether a database is better than a DBM in this instance. A DBM allows quick pattern matching across the entries in the hash without the overhead of having to pull the info out of a database and...

Mike That was certainly my thinking, but given that data is essentially 1 table with 2 fields, I thought that something like DBM (basically a persistant hash) might be a better option. Have you had any experience using DBM? thanks in advance Derek

Thanks for your suggestions. I have some experience with mySQL so I have considered that option. However, given that the data will only be 1 table with 2 fields, I thought something like the DBI_File module might be more useful. For example, I will be writing a simple search to extract the...

I have a friend who is a photographer and I'm helping him get his images online. He says there will eventually be 40,000 images. The image data that visitors to his web site need to search is: 1. the filename: in the format "John Doe tackles Bill Smith 101001.jpg"; and 2. the JPG...

Neil I'm a bit of a newbie @ Perl so I'm not certain what your code is doing. When I ran it it returned: intersect: three two union: one three two four it should return: one four any ideas?

I want to compare 2 arrays (@DAT & @DIR - which represent an array of files in 2 different directories) and return an array of entries in @DAT that don't exist in @DIR and an array of entries in @DIR that don't exist in @DAT. I have written the following code which appears to work, however I'm...