Serialization and Persistent Objects

Turning Data Structures into Efficient Databases

Recently, the pressure for fast processing and efficient storage of large data with complex relations increased beyond the capability of traditional databases. Typical examples include iPhone applications, computer aided design – both electrical and mechanical, biochemistry applications, and incremental compilers. Serialization, which is sometimes used in such situations is notoriously tedious and error prone.

In this book, Jiri Soukup and Petr Macháček show in detail how to write programs which store their internal data automatically and transparently to disk. Together with special data structure libraries which treat relations among objects as first-class entities, and with a UML class-diagram generator, the core application code is much simplified. The benchmark chapter shows a typical example where persistent data is faster by the order of magnitude than with a traditional database, in both traversing and accessing the data.

            To Springer book page                                               To Amazon book page


Selected resources from the book to aid in your understanding of the concepts.


Join the discussion about the book

Source of the benchmark coded as an iPhone app (QSP persistence algorithm)

bk directory

Source of all Listings and Examples 
from the book (ZIP)


Source of all Benchmark Programs

Results of all Benchmarks


Proposal to Add a Keyword to All OO Languages (will be available in a couple of weeks when the book will be released)



 Libraries:  Reference links for libraries and products related to the book

 Code Farms     POST++