| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: The IDS, the EDS and the DBMS
On Tue, 14 Sep 2004 13:29:11 -0700, Mikito Harakiri wrote:
> "Paul" <paul_at_test.com> wrote in message > news:414745d8$0$13400$ed2e19e4_at_ptn-nntp-reader04.plus.net...
Indeed, but you could reformulate the problem a bit such that there is an input with a certain size. For example for the addition x + y over integers you know that the size of the result can be represented in O(max(|x|,|y|)). But for the multiplication x * y this is O(|x|+|y|). Quite interestingly if you consider the operations over unnormalized formulas (so no normalization at all and x + y is straightforwardly represented as "(" x "+" y ")") then for both operations you also have an upperbound of O(|x|+|y|). So in terms of space the addition becomes just as unwieldy as the multiplication already was. :-)
The question about the complexity of normalization is also interesting. From Tarksi we know that the reals are axiomatisable and you can represent these numbers by sets of simple equations. That's probably already been researched by somebody in the context of constraint databases and/or spatial databases.
![]() |
![]() |