Re: The TransRelational Model: Performance Concerns

On Wed, 10 Nov 2004 23:54:59 -0800, Josh Hewitt wrote:

> In my opinion, in its current form (as described in the appendix of
> C.J. Date's "An Introduction to Database Systems (8th ed)" and the
> published patent) the TRM is not a feasible candidate for implementing a
> relational DBMS.

Thanks for an interesting posting.

IO-intensiveness of insertions in TRM seems rather unavoidable.

But I thought that some of the IO overhead in searches could maybe be avoided by adding some kind(s) of indexes to the model? I know that this sounds rather strange, because one of the ideas of TRM seems to be that all columns are clustered, enabling (somewhat) quick searching by "themselves".

Another thought: All your examples seem to be use of fully projected relations, corresponding to SELECT * FROM ... Maybe TRM has value if most of the actual queries project to only a fraction of the existing columns?

-- 
Greetings from Troels Arvin, Copenhagen, Denmark