But this is the typical difference between an object oriented database
system and an object oriented storage management or persistency system
or however all these solutions are called - and you find these problems
in all object oriented languages (even in Java and C# :-)).

OODBMS (Versant, Objectivity or Gemstone) have indices like the relational
counterparts, which can speed up a query very much !!!

I always looked at persistency solutions and all I have to say is,
that I always went back to relational databases due to these problems
you mention.

Marten

Daniel Salama schrieb:

> happens only once. I'm more concerned with the day-to-day accessing of 
> data. That's where my performance concerns fall in, when it comes to 
> GOODS. For example, one of the most used queries in my app are for 
> batched lists. Say a user wants to see a list of customers. The 
> default batch size is to show 50 records at a time and the default 
> sort is by customer name. Currently the user has the ability to sort 
> by any of the columns in the batch list by simply clicking on the 
> column title. If I understand correctly, it means that I would have to 
> load all 1MM records into Squeak to sort them based on the user 
> selection and then jump ahead to whichever page the user was looking 
> at and then show 50 records. As most everyone know, in the SQL world 
> this is easily solved by the SELECT * FROM * ORDER BY * OFFSET * LIMIT 
> * command. I don't know if OmniBase supports a more efficient way of 
> doing this, or even if the approach I mentioned is the most efficient 
> one.
>