Sophisticated client/server locking techniques ensure high concurrency
The c-tree Server employs sophisticated locking techniques to prevent deadlocks and ensure maximum concurrency and throughput. With a variety of locking techniques available, FairCom gives developers the flexibility they need to meet their development requirements.
"Anti-Deadlock" Performance Features
All c-tree Servers perform extensive internal deadlock detection and resolution measures. Deadlocks can never occur between readers and updaters. If a deadlock does occur between multiple updaters, the deadlock detection mechanism provides automatic and immediate deadlock resolution. Only the minimum number of users required to resolve the deadlock are ever affected.
Ultra-high User Concurrency
c-tree Servers incorporate powerful internal indexing technology that allows a very high level of concurrency among c-tree Server clients without jeopardizing data integrity. Unlike other Servers that may require a lock to be placed on all the key values within an index node, FairCom's advanced indexing locks provide absolute data availability by issuing a short lived lock over only the individual key value.
Newly developed imaging and multi-versioning techniques avoid most read lock interference experienced between clients that query and clients that write. Writers or updaters don't necessarily block queries, and queries need not block anyone. The only interference that may occur is between multiple updaters, which can be easily controlled with FairCom's flexible locking routines.
No Page Locks Are Ever Performed by c-tree Servers
Page locks spanning several data records are never performed by c-tree Servers. File level locking is available, but never required. Record level locks are fully supported as both read or write locks, but again, read locks are not required. All locking is performed strictly within the Server and no change is ever made to the information residing on disk. There is no practical limit to the number of locks a user may hold.
|
