I found this node referenced in the POD for Data::Hash::Flatten.
The fundamental issue is an inappropriate data structure. Given what you want to do with the data, a HoHoHoH is (as you've discovered) cumbersome for many searches.
The problem illustrates the weakness of hierarchical databases. Your data model could be restated as a relational table with four columns:
The first three items together constitute the "key"; all three are required to uniquely specify a count.
An array of hashes would be a more useful model, since each count is identified by a combination of user, date, and file. Without all three pinned down, you may have more than one "row" identified.
An array of arrays would do as well, if you don't mind giving up the symbolic "column" names.
yours,
Michael
In reply to Re: creating multiple views of a hash by reordering its key and values
by herveus
in thread creating multiple views of a hash by reordering its key and values
by princepawn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |