Re: Alternatives to ACID, non-serialized concurrent transactions?

From: Carl Rosenberger <carl_at_db4o.com>
Date: Tue, 6 May 2003 22:04:54 +0200
Message-ID: <b993rm$71k$06$1_at_news.t-online.com>


Todd Bandrowsky wrote:
> Yeah, I suppose the classic answer would be that these would be
> separate tables, but I'm wondering if there is not something more that
> could be done. Sometimes as I do SQL I wonder if I am working on
> making a wheelock more efficient when someone really just needs to
> invent the cartridge!

The problem with SQL:
It's not built for single objects and it can become difficult to specify what belongs to an object. There are no objects just relations.

> > I am thinking about a "locking-by-example" concept:
> > You construct a graph of objects as an example to describe the depth
> > of objects and all the child objects that are to be locked. This
> > "lock all as the example" could be applied to a query result.
>
> That is very interesting. To take it even further, we could assign
> terms to varying common graph operations, and we might wind up with
> lock by expression. Does any database implement that?

Sure:
Oracle supports "select [x] for update;"

Replace [x] with the joins, coalesce, group and where clauses you wish.

Your statement may just become very complex.

Kind regards,
Carl

--
Carl Rosenberger
db4o - database for objects - http://www.db4o.com
Received on Tue May 06 2003 - 22:04:54 CEST

Original text of this message