S(b)-Trees: an Efficient Way of Indexing Data
The project is supported in part by the
Russian Foundation of Fundamental Research (grant No. 96-01-01005)
The project is developed in the
Program Systems Institute, Russian Academy of Science
Pereslavl-Zalessky, 152140 Russia

An External Dynamic Dictionary is implemented based on a new type of Balanced Trees intended to provide high packing of variable length keys, and fast access to the data.

For the S(b)-tree basic concepts overview, the library interface, and the implementation details please visit the following pages.

Contents

	Introduction
	Common properties of balanced trees
	B-trees
	Definition of S(b)-trees
	Utilization of S(b)-trees
	The scetch of the algorithms
	The S(b)-tree library interface
	The specifications

	Download our library, and try it with your software.
	Send us your bug reports, and
	E-mail suggestions to shv@namesys.botik.ru.
	Publications.
	Acknowledgements.
	Ph.D. Thesis.