Collapse All Expand All Code: All Code: Multiple Code: C# Code: Visual Basic Code: Visual C++

C#
Visual Basic
Visual C++

Berkeley DB .NET API Documentation
SecondaryBTreeDatabaseConfig..::.NoReverseSplitting Field
SecondaryBTreeDatabaseConfig Class See Also

Turn reverse splitting in the Btree on or off.

Namespace: BerkeleyDB
Assembly: libdb_dotnet48 (in libdb_dotnet48.dll) Version: 4.8.24.0

# Syntax

C#
    public bool NoReverseSplitting

Visual Basic (Declaration)
    Public NoReverseSplitting As Boolean

Visual C++
    public:
    bool NoReverseSplitting

# Remarks

As pages are emptied in a database, the Berkeley DB Btree implementation attempts to coalesce empty pages into higher-level pages in order to keep the database as small as possible and minimize search time. This can hurt performance in applications with cyclical data demands; that is, applications where the database grows and shrinks repeatedly. For example, because Berkeley DB does page-level locking, the maximum level of concurrency in a database of two pages is far smaller than that in a database of 100 pages, so a database that has shrunk to a minimal size can cause severe deadlocking when a new cycle of data insertion begins.

# See Also

SecondaryBTreeDatabaseConfig Class
BerkeleyDB Namespace