Writing WiredTiger applications

This section covers topics of interest for programmers writing WiredTiger applications.

We follow SQL terminology: a database is set of tables managed together. Tables consist of rows, where each row is a key and its associated value. Tables may optionally have an associated schema, splitting the value into a set of columns. Tables may also have associated indices, each of which is ordered by one or more columns.

Using the API

• Getting Started with the API
• Configuration Strings
• Cursors
• Transactions
• Error handling

Storage options

• Schema, Columns, Column Groups, Indices and Projections
• Log-Structured Merge Trees
• File formats and compression
• Compressors
• Encryptors

Programming notes

• Multithreading
• Name spaces
• Signal handling

Advanced topics

• Asynchronous operations
• Backups
• Checkpoint durability
• Compaction
• Log cursors
• Commit-level durability
• Per-process shared caches
• Statistics
• Upgrading and downgrading databases

Extending WiredTiger

• Extending WiredTiger
• Custom Collators
• Custom Extractors
• Custom Data Sources
• WiredTiger Helium support

Performance monitoring and tuning

• Performance monitoring with statistics
• Simulating workloads with wtperf
• Visualizing performance with wtstats

• Memory allocator
• Page and overflow key/value sizes
• Cache and eviction tuning
• Bulk-load
• Cursor persistence
• Read-only objects
• Commit-level durability
• Checksums
• Compression
• File allocation
• System buffer cache
• Linux transparent huge pages
• Connection close
• Mutexes
• Linux zone reclamation memory management