Parallel membership queries on very large scientific data sets using bitmap indexes. (28th January 2019)

• Record Type: Journal Article
• Authors: Yildiz, Beytullah; Wu, Kesheng; Byna, Suren; Shoshani, Arie
• Is Part Of: Concurrency and computation. Volume 31:Number 15(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-01-28
• Subjects: big data -- bitmap index -- data management -- membership query -- parallel query -- scientific data; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5157
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Many scientific applications produce very large amounts of data as advances in hardware fuel computing and experimental facilities. Managing and analyzing massive quantities of scientific data is challenging as data are often stored in specific formatted files, such as HDF5 and NetCDF, which do not offer appropriate search capabilities. In this research, we investigated a special class of search capability, called membership query, to identify whether queried elements of a set are members of an attribute. Attributes that naturally have classification values appear frequently in scientific domains such as category and object type as well as in daily life such as zip code and occupation. Because classification attribute values are discrete and require random data access, performing a membership query on a large scientific data set creates challenges. We applied bitmap indexing and parallelization to membership queries to overcome these challenges. Bitmap indexing provides high performance not only for low cardinality attributes but also for high cardinality attributes, such as floating‐point variables, electric charge, or momentum in a particle physics data set, due to compression algorithms such as Word‐Aligned Hybrid. We conducted experiments, in a highly parallelized environment, on data obtained from a particle accelerator model and a synthetic data set.