pith. sign in

arxiv: 1508.07749 · v1 · pith:BHHWUNCHnew · submitted 2015-08-31 · ⚛️ physics.data-an · cs.DC

ROOT - A C++ Framework for Petabyte Data Storage, Statistical Analysis and Visualization

classification ⚛️ physics.data-an cs.DC
keywords datarootanalysislargemacrosstatisticalavailableclasses
0
0 comments X
read the original abstract

ROOT is an object-oriented C++ framework conceived in the high-energy physics (HEP) community, designed for storing and analyzing petabytes of data in an efficient way. Any instance of a C++ class can be stored into a ROOT file in a machine-independent compressed binary format. In ROOT the TTree object container is optimized for statistical data analysis over very large data sets by using vertical data storage techniques. These containers can span a large number of files on local disks, the web, or a number of different shared file systems. In order to analyze this data, the user can chose out of a wide set of mathematical and statistical functions, including linear algebra classes, numerical algorithms such as integration and minimization, and various methods for performing regression analysis (fitting). In particular, ROOT offers packages for complex data modeling and fitting, as well as multivariate classification based on machine learning techniques. A central piece in these analysis tools are the histogram classes which provide binning of one- and multi-dimensional data. Results can be saved in high-quality graphical formats like Postscript and PDF or in bitmap formats like JPG or GIF. The result can also be stored into ROOT macros that allow a full recreation and rework of the graphics. Users typically create their analysis macros step by step, making use of the interactive C++ interpreter CINT, while running over small data samples. Once the development is finished, they can run these macros at full compiled speed over large data sets, using on-the-fly compilation, or by creating a stand-alone batch program. Finally, if processing farms are available, the user can reduce the execution time of intrinsically parallel tasks - e.g. data mining in HEP - by using PROOF, which will take care of optimally distributing the work over the available resources in a transparent way.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SMEFT everywhere: a NLO study of $\boldsymbol{pp \to t\bar{t}H}$ with decaying tops

    hep-ph 2026-05 unverdicted novelty 6.0

    NLO QCD corrections to pp to ttbar H in the di-lepton channel with SMEFT operators included in both production and top-quark decays.

  2. Software and computing for Run 3 of the ATLAS experiment at the LHC

    hep-ex 2024-04 unverdicted novelty 2.0

    ATLAS reports on its Run 3 software infrastructure for data management, workflows, databases, validation, and physics analysis tools at the LHC.