On 2 May 2010 22:03, Luciano Ramalho luci...@ramalho.org wrote:
In these, we don't store serialized objects, but just the data to
reconstruct the objects. But the data is not completely dismembered in
some normalized form.
In a semi-structured database the data graph can follow very closely
Am 04.05.2010, 19:20 Uhr, schrieb Laurence Rowe l...@lrowe.co.uk:
I suspect that databases such as CouchDB and the others you mention
are not well suited to graph traversal. Efficient traversal must occur
near the data, otherwise you pay the latency cost on each edge
traversed. In ZODB this
On 4 May 2010 18:46, Charlie Clark charlie.cl...@clark-consulting.eu wrote:
Am 04.05.2010, 19:20 Uhr, schrieb Laurence Rowe l...@lrowe.co.uk:
I suspect that databases such as CouchDB and the others you mention
are not well suited to graph traversal. Efficient traversal must occur
near the
Am 04.05.2010, 23:45 Uhr, schrieb Laurence Rowe l...@lrowe.co.uk:
It's worth noting that many RDBMS's do now support recursive queries
of some kind (Postgres introduced them in 8.4), though it's not yet
ubiquitous.
Windowing functions and their ilk might well reinvigorate the RDBMS world.
BACKGROUND
I was attracted to Zope in 1998 because it freed us from the
clumsiness of the first normal form.
Many in the Zope community can also boast membership of the NoSQL old-guard.
The ZODB is great, but it, and all other OODBs, have a serious
problem: the data is tied too closely to the
