Abstract
All authors of persistent systems claim that their systems are super fast. This chapter compares the performance of ten major persistent systems on a benchmark which involves up to one million books and a many-to-many relation between books and their authors. The books can be with or without abstracts. The results are most interesting and intriguing.
WARNING
: Comparing times shown in this chapter without considering features of each system as discussed in the previous chapters may lead to a wrong conclusion about what is the “best” persistent system—if there is such a thing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
E.U. grant CENAQUA CZ1.05/2.1.00/01.0024.
- 4.
The prototype described in Sects. 2.5 and 6.5.
- 5.
This is what we did when testing with SQLite.
- 6.
Sometimes also called schema migration.
- 7.
Numbers or text, anything but references (or pointers).
- 8.
For example, using different class libraries or different data structures.
- 9.
This is done by using attribute DataContract(Name=“L”).
- 10.
See Sect. 2.2.2; for more details (Soukup 1994, p. 379); how to use it http://www.codefarms.com/docs/dol/index.htm, Sect. 13.2, Memory management.
- 11.
Konstantin Knizhnik, Russia.
- 12.
- 13.
- 14.
- 15.
The source is available on the website, but be aware that, except for this benchmark, it has not been used on any serious project yet.
- 16.
For the full source see directory bk/chap7/benchApple.
- 17.
For more information, see Sect. 6.3.
- 18.
This idea is based more on experimental evidence than on the exact knowledge of the HD construction or of the internal design of the disk drive.
- 19.
This idea is applicable only to persistent systems based on memory paging, because all the other systems read the disk sequentially anyway.
- 20.
We used Ver.1.53.
- 21.
InCode library has them but we did not want to go through the conversion of InCode to Boost. Also, we believe that persistent systems should be tested with their native libraries.
- 22.
Such as available from InCode or DOL.
References
Soukup J (1994) Taming C++, pattern classes and persistence for large projects. Addison-Wesley (Japanese translation ISBN 4-8101-8088-3), Reading, MA
Urban J, Vaněk J, Soukup J, Štys D (2009) Expertomica metabolite profiling: getting more information from LC-MS using the stochastic systems approach. Bioinformatics 25(20):2764–2767. doi:10.1093/bioinformatics/b
Urban J, Vaněk J, Štys D (2012) Systems theory in liquid chromatography. In: Mass spectrometry, LAMBERT Academic Publishing, ISBN-13: 978-3-659-29816-5
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soukup, J., Macháček, P. (2014). Benchmark. In: Serialization and Persistent Objects. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39323-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-39323-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39322-8
Online ISBN: 978-3-642-39323-5
eBook Packages: Computer ScienceComputer Science (R0)