My current interests related to software application development and the
tools employed for such are aimed in two primary directions -- databases and
distributed computing.  XML plays in both of these categories.  In
discussions related to both topics, there is a lot of lashing out ...

Normally, in one-to-many relationships, where you don't know how many
is many, it is necessary to have two tables linked to each other. But
supposing there were a fixed number of relationships.  How would that
change your view over using two linked tables over one big wide one?

Let's talk about supertype-subtype relationship.  Here's the problem:
I have to use a column in the supertype to find a corresponding
subtype.   Here's an example:
Say we have a supertype, S, with three subtypes, X, Y, and Z.  I add a

A posting on comp.databases.object referenced an article by Adrian Jones at
http://www.theregister.co.uk/content/53/31613.html, and while the article is
memorable, I don't think it's for the reasons intended by the poster. I've
embedded my comments below.

I wonder if any RDBMSes support using Datalog or Prolog as a language for
stored procedures, or perhaps as a supplementary way to query the
database, somehow?

My reading of Date's work in regard to his reference to the application
software layer is that is is located external to the (R)DBMS as seems
indicated by a number of diagrams in the introductory chapters.
Initially this would seem understandable, from the historical perspective

I would like to know your opinion about which are the biggest flaws
and mistakes of ADO.NET.
Thanks
 Alfredo

If we were to find a sponsor for a competition where the winner would be a
named data model and the primary criteria would be related to the cost tor
an institution choosing to use that data model (including costs if there is
a lack of quality or breach of security or difficulty in ...

Hello readers,
In another thread I was asked to produce an example which
can not be implemented with RDBMS constraints.
I have given this some thought.

This is a partial response to Eric's previous e-mail.
Where should constraints be specified?
Take a services framework that includes an interface for "web services" such
as SOAP-wrapped XML that comes in from some place external to our system and

In query processing, a ODBMS parse a OQL request in a query tree
corresponding to object algebra.  But, unlike relational algebra, there
is no standard object algebra.  So, could you help me to find some good
object algebra please (example: link to research university)?

This is in reply to the “foundations of relational theory?” thread which
began on September 26, 2003 and accumulated over 500 responses before
petering out on November 7, 2003. Yes, I read them all, and was
fascinated. Apologies - I found them only after the thread had run cold.

we have implemented our own, specialized data storage. We need now the
possibility to search on strings with wildcards. Can somebody give me a
starting point on how to implement such an index?
regards,

I am working on a design problem where I have many (possibly
multinational) customers with tree structured administrative structures
(cust, nation, region, site, building for instance). At the leaf nodes
of the administrative tree, there is a tree organized location system

I am pleased to announce the 1.0a11 release of e4Graph, the eleventh
Alpha release. This is definitely the final Alpha release for 1.0, the
next release is 1.0b1.
WHAT IS IT: