Browse thread
[1/2 OT] Indexing (and mergeable Index-algorithms)
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2005-11-18 (20:01) |
From: | Gerd Stolpmann <info@g...> |
Subject: | Re: [Caml-list] [1/2 OT] Indexing (and mergeable Index-algorithms) |
Am Freitag, den 18.11.2005, 16:14 +0100 schrieb Florian Weimer: > * Thomas Fischbacher: > > >> No, it isn't. Berkeley DB offers much richer functionality, including > >> transactions and replication. > > > > However, crashes at unfortunate moments may lead to database > > corruption, > > All my crashes could be traced back to operator error and faulty > hardware. Berkeley DB has a very bad reputation when it comes to data > integrity and durability, but in my experience, this is simply not > true. I think it is true. A good database must not become corrupt even if the hardware crashes. It must be possible to simply undo the last operation after a crash, and the integrity must not suffer from that. Although BDB promises this stability, I had to throw away a number of databases after hardware crashes. There are simply errors in it, and I cannot recommend it anymore. Gerd -- ------------------------------------------------------------ Gerd Stolpmann * Viktoriastr. 45 * 64293 Darmstadt * Germany gerd@gerd-stolpmann.de http://www.gerd-stolpmann.de Telefon: 06151/153855 Telefax: 06151/997714 ------------------------------------------------------------