<o> <-- your joke
O
/|\ <-- me
/\
I've read so long and unbelievable discussions regarding relational vs
ORM persistence, I'm always afraid of asking...
Cheers,
Daniel
igor.vaynberg wrote:
>
> http://dictionary.reference.com/browse/facetious
>
> -igor
>
> On Wed, Oct 7, 2009 at 8:54 AM, dtoffe <dto...@yahoo.com.ar> wrote:
>>
>> This is an example of a requirement that often pops up where I work:
>> let's say the system registers sales, there are an average 5K orders a
>> day
>> and each sale has an average 3 items. Items have a category. I'm required
>> to
>> produce a listing of daily sales grouped by category, with a daily total.
>> In
>> each row I'm required to provide the same data for the same day of the
>> previous year. The listing must be produced for any given pair of start
>> and
>> end dates.
>> I don't believe a file system serialization based persistence
>> mechanism
>> will do well for a requirement like this, although I must admit I never
>> tried that before. Can you give me a clue of a comparison it to an old
>> fashioned relational database please ?
>>
>> Cheers,
>>
>> Daniel
>>
>>
>> igor.vaynberg wrote:
>>>
>>> pft, just use a lucene file crawler, you get super fast searching for
>>> free!
>>>
>>> -igor
>>>
>>> On Tue, Oct 6, 2009 at 5:52 PM, James Carman
>>> <jcar...@...> wrote:
>>>> What about queries against your persistent storage tier? Wouldn't
>>>> that be quite slow?
>>>>
>
--
View this message in context:
http://www.nabble.com/How-do-you-achieve-persistency-tp25765566p25789750.html
Sent from the Wicket - User mailing list archive at Nabble.com.
---------------------------------------------------------------------
To unsubscribe, e-mail: users-unsubscr...@wicket.apache.org
For additional commands, e-mail: users-h...@wicket.apache.org
