Bitmap indices for fast end-user physics analysis in ROOT

Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment

Volumn 559, Issue 1 SPEC. ISS., 2006, Pages 99-102

  Stockinger, Kurt ^a   Wu, Kesheng ^a   Brun, Rene ^b   Canal, Philippe ^c  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b CERN   (Switzerland)

^c FERMI NATIONAL ACCELERATOR LABORATORY   (United States)

Author keywords

Bitmap index; Fast queries; Physics analysis; ROOT; ROOT Trees; Speed data base access

Indexed keywords

DATA REDUCTION; PERFORMANCE; PROCESS CONTROL; TREES (MATHEMATICS);

BITMAP INDEX; FAST QUERIES; PHYSICS ANALYSIS; ROOT TREES; SPEED DATA BASE ACCESS;

DATABASE SYSTEMS;

EID: 33644950279     PISSN: 01689002     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.nima.2005.11.127     Document Type: Article

References (5)

1. P. O'Neil, Model 204 architecture and performance, in: Second International Workshop in High Performance Transaction Systems, Asilomar, California, USA, Springer, Berlin, 1987.
2. K. Wu, E.J. Otoo, A. Shoshani, On the performance of bitmap indices for high cardinality attributes, in: International Conference on Very Large Data Bases, Toronto, Canada, September 2004, Morgan Kaufmann, Los Altos, CA.
3. C.Y. Chan, Y.E. Ioannidis, An efficient bitmap encoding scheme for selection queries, in: SIGMOD, Philadelphia, Pennsylvania, USA, June 1999, ACM Press, New York.
4. T. Johnson, Performance measurements of compressed bitmap indices, in: International Conference on Very Large Data Bases, Edinburgh, Scotland, September 1999, Morgan Kaufmann, Los Altos, CA.
5. K. Stockinger, K. Wu, A. Shoshani, Evaluation strategies for bitmap indices with binning, in: International Conference on Database and Expert Systems Applications (DEXA), Zaragoza, Spain, September 2004, Springer, Berlin.