AVLDB

Introduction

AVLDB (Adelson-Velskii + Landis database) is a multiuser multi-volume database library written in C. Only indexing method is threaded AVL (Adelson-Velskij-Landis) tree (functions for manipulation of binary trees was borrowed from Ben Pfaff's GNU libavl 2.0).

Strictly speaking, there is no indexing, or, there is no difference between indexes and data itself. Any secondary index results in another copy of the file. There are no relations - there is a type of field called a "link" (corresponding to 'it contains "..."' or "object has A") instead. Released version is an 'alpha version' of the database library - courageous volunteers (with suicidal tendencies) are invited to test it.

Key fetures

Meta-scheme - multiple files (tables), indexes etc.
Transactions - after/before-imaging ( undo/redo in different slang )
Locking - support of concurrent access to the data
Binary large objects
Multi-volume database