Developments in ROOT I/O and trees
R. Brun (CERN), P. Canal (Fermilab), M. Frank (CERN), A. Kreshuk, (CERN), S. Linev (Darmstadt, GSI), P. Russo (Fermilab), F. Rademakers (CERN)

TL;DR
This paper discusses recent enhancements in the ROOT I/O package, including performance improvements, new utilities, and better support for remote access, threading, and multi-core architectures, significantly boosting data handling efficiency.
Contribution
It introduces a comprehensive set of updates to ROOT I/O, notably remote file access optimization, new utilities, and improved modularity and multi-core support, marking a substantial advancement over previous versions.
Findings
Remote file access gain of an order of magnitude
TTree cloning performance improved by an order of magnitude
Enhanced support for XML, SQL, threading, and schema evolution
Abstract
For the last several months the main focus of development in the ROOT I/O package has been code consolidation and performance improvements. Access to remote files is affected both by bandwidth and latency. We introduced a pre-fetch mechanism to minimize the number of transactions between client and server and hence reducing the effect of latency. We will review the implementation and how well it works in different conditions (gain of an order of magnitude for remote file access). We will also review new utilities, including a faster implementation of TTree cloning (gain of an order of magnitude), a generic mechanism for object references, and a new entry list mechanism tuned both for small and large number of selections. In addition to reducing the coupling with the core module and becoming its owns library (libRIO) (as part of the general restructuration of the ROOT libraries), the I/O…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
