I randomly surfed my way to a PC World article on the
"25 Worst Tech Tech Products of All Time." It was actually
better done than those sorts of things usually are.
I was interested to see item #5: dBASE IV.

I wonder if anyone has any thoughts on using the materialized path as
an intermediate step to create a kind of paths table to represent a
tree hierarchy
Here are some records

The Relational Lattice algebra ("RL") consists of two
generic operations on relations: natural join, written
"&&", and inner union, written "||".
It has been shown that the RL operations possess the following

The beginning can be found on
http://groups.google.com/group/comp.databases.theory/browse_frm/thread/32e771cb8
a3e70af
Here...
http://groups.google.com/group/comp.databases.theory/tree/browse_frm/thread/32e7
71cb8a3e70af/24b09e5385c76ceb?rnum=11&_done=%2Fgroup%2Fcomp.databases ...

Let's say that we have a noun present in a conceptual data model, but
not identified as a strong entitiy (recognizing not all conceptual
modeling techniques use such distinctions).  What are the conditions
under which this noun will/should translate into an attribute in a

Dawn,
One of my practical objections to MVL is that it obscures data.  I'd like to
know what you might offer to that objection.
I am in the school of thought that says that if you need a list, make a

The term "process model" seems to have raised a lot of questions, and not to
have conveyed what I intended to convey.
Here's an example that illustrates, roughly, what I mean by a "process
model".  This is a brief quote from "Object Oriented Analysis" by Coad and

I just stumbled over this exchange from Oct 2005 on the TRM...
    http://www.dbms2.com/2005/10/10/17/
It was authored by a "Curt Monash" - is he known to any CDT'ers and/or
credible?

Recently, in a thread on implementing both threads and lists in a
programming language,  the example of lists or sets of Presidents arose.  I
mentioned that in a list of presidents,  Grover Cleveland would appear once,
but in a list of presidencies, he would appear twice.

I was just wondering if it is possible to create a database design
where you can have
1. Infinite repeating events like "every year, every last monday,..."
2. The possibility to test whether events overlap other events

Yes. I've found "TheORM" on dbdebunk.com - of course as VOCIFEROUS
IGNORANCE and in "Laugh or Cry" part. I don't think it is a problem,
because all things, which are out of numb dogma, look like vociferous
ignorance from point of view of this dogma.

Is a relation's 'name' in fact a pointer? Relation names obviously
don't come under the remit of the information principle, yet they are
essential to database manipulation and querying. Are they hence an
acceptable/necessary exception?

I am trying to discern what (an) algorithm might be, that would compare two
databases which, at one time were mirror's of each other. That is, if at one
point in the past, I had DB A, which was a mirror image of DB B, and A has
not been touched, B has been in use. Now I want to ...

There is probably some standard terminolgy for what you are about to read.
I don't know what that standard terminology is.  Sorry about that.
I think it's worthwhile, in the discussion of infinite domains and finite
state implementations,  to distinguish between "infinite" and ...

I must  reply to this thread. I was a methodologist with KnowledgeWare and
with IBM in the late 80's,  early 90's. The big joke was "What's the
difference between a methodolgist  and a terrorist?" You can reason with a
terrorist.