1-13 start/2007-02-28/1

Anyway, allow me to provide with yet another example… Say you have a class with a state machine. This class has states s1, .., sn. Now you wish to provide a way for the user to search through your 1e7 records with a criteria that maps to a set of check boxes representing each state. Selecting none searches objects with any state. Selecting some represents the union of states selected. - jpmsi

And if a tell you that we keep an hashtable/structure with the mapping state->{elements in that state}. And that we identify that structure as and important concept in our domain. And for efficiency reasons that structure is mapped into a view like the examples above. In many cases we can transform a problem to match a pattern more familiar to DDD.

Nevertheless the paging issue is terrible. I currently don't know a solution that does not require all objects to be in memory. Paging really requires a deep integration with the presistency engine.

When can we see your tests result data? - pabrantes

It's coming up slow. But it's coming up more like a curiosity and a dismissal (or confirmation) of some dogmas than a definitive answer to most of the questions we've made here. Sometime soon …