BERKELEY (200 millions de deploiement):
Local, in-process data storage
Schema-neutral, application native data format
Indexed and sequential retrieval (Btree, Queue, Recno, Hash)
Multiple processes per application and multiple threads per process
Fine grained and configurable locking for highly concurrent systems
Support for secondary indexes
In-memory, on disk or both
Online Btree compaction
Online Btree disk space reclamation
Online abandoned lock removal
On disk data encryption (AES)
Records up to 4GB and tables up to 256TB
Full ACID compliance
Selectable isolation levels and durability guarantees, configurable on a per-transaction basis
Support for nested transactions
Distributed transactions (XA)
Catastrophic and routine failure recovery modes
Automated recovery serialization
Flexible and configurable deadlock detection
Support for application-specific log file records and recovery
Hot and cold backups, log file archival, and full database dumps
Single master, multiple replica model
Automatic failover/re-election
Paxos-compliant election algorithm
New replicas can join the group at any time
Hot standby
Geographically distributed nodes
In-memory replication option
Client-to-client replication
Delayed client synchronization
Synchronization throttling
Network transport agnostic
Proven scalability to thousands of replica nodes
Programmatic administration and management - zero human administration
Language support (C, C++, Java, Perl, Python, PHP, Tcl, Ruby, etc.)
Operating system support (Linux, Windows, BSD UNIX, Solaris, Mac OS/X, VxWorks and any POSIX-compliant operating system)
Installer for Microsoft Windows
Apache integration
RPC enabled API
Support for memory constrained devices (footprint as small as 350KB)
Scalable to terabytes of data, billions of records
Source code, test suite included
Partager