Rather, the proposal is focusing on what users of these data structures
would / could see. The idea is that relational structures have the same
ease of use and flexability that things like hashes or arrays or sequences
or sets do now. They can of course just be stored in RAM like the
aforemen
At 5:31 AM +0100 8/31/06, Nigel Hamilton wrote:
Rather, the proposal is focusing on what users of these data structures
would / could see. The idea is that relational structures have the same
ease of use and flexability that things like hashes or arrays or sequences
or sets do now. They can of
On Wed, 30 Aug 2006, Nigel Hamilton wrote:
> HI Darren,
> Generally I really like the idea of fixing the relational/OO
> mismatch problem by swallowing the relational model whole. :-)
> But I wonder if we are ready to say goodbye to the tyranny of disk
> seek? How will your proposed s
HI Darren,
Generally I really like the idea of fixing the relational/OO
mismatch problem by swallowing the relational model whole. :-)
But I wonder if we are ready to say goodbye to the tyranny of disk
seek? How will your proposed system use the disk? And if it does use the
disk what abou
All,
This email is part of a brain dump from my thoughts over the last
week while I was away from a computer. If anything doesn't make
sense, I will clarify or expand it in the following days.
I believe that Perl 6 already has basically all of the necessary
parts built-in for implementing a
