bioRxivBioinformaticsPreprint
Coordinate-based mapping of tabular data enables fast and scalable queries
Stephen PiccoloiD, Zachary E. Ence, Kimball HilliD, PJ Tatlow, Brandon J. Fry, Jonathan B. Dayton
Abstract
MotivationBiologists commonly store data in tabular form with observations as rows, attributes as columns, and measurements as values. Due to advances in high-throughput technologies, the sizes of tabular datasets are increasing. Some datasets contain millions of rows or columns. To work effectively with such data, researchers must be able to efficiently extract subsets of the data (using filters to select specific rows and retrieving specific columns). However, existing methodologies for querying tabular data do not scale adequately to large datasets or require specialized tools for processing. We sought a methodology that would overcome these challenges and that could be applied to an existing, text-based format. ResultsIn a systematic benchmark, we tested 10 techniques for querying simulated, tabular datasets. These techniques included a delimiter-splitting method, the Python pandas module, regular expressions, object serialization, the awk utility, and string-based indexing. We found that storing the data in fixed-width formats provided excellent performance for extracting data subsets. Because columns have the same width on every row, we could pre-calculate column and row coordinates and quickly extract relevant data from the files. Memory mapping led to additional performance gains. A limitation of fixed-width files is the increased storage requirement of buffer characters. Compression algorithms help to mitigate this limitation at a cost of reduced query speeds. Lastly, we used this methodology to transpose tabular files that were hundreds of gigabytes in size, without creating temporary files. We propose coordinate-based, fixed-width storage as a fast, scalable methodology for querying tabular biological data. Contactstephen_piccolo@byu.edu
- research focus: benchmarking
- research focus: database / resource
- approach: benchmark study
- approach: statistical model
- Citations
- 1
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- STABIX: Summary statistic-based GWAS indexing and compression
Kristen Schneider, Simon Walker, … Ryan M. Layer·BioinformaticsPeer-reviewed·Apr 29, 2025
- PubData: search engine for bioinformatics databases worldwide
Bohdan B. Khomtchouk, Kasra A. Vand, … Claes Wahlestedt·bioRxiv·Aug 16, 2016
- Scalable sequence database search using Partitioned Aggregated Bloom Comb-Trees
Camille Marchet, Antoine Limasset·BioinformaticsPeer-reviewed·May 25, 2023
- fimpera: drastic improvement of Approximate Membership Query data-structures with counts
Lucas Robidou, Pierre Peterlongo·bioRxiv·Jun 27, 2022
- Epiviz File Server: Query, Transform and Interactively Explore Data from Indexed Genomic Files
Jayaram Kancherla, Yifan Yang, … Héctor Corrada Bravo·BioinformaticsPeer-reviewed·Jun 27, 2020
- DREAM-Yara: An exact read mapper for very large databaseswith short update time
Temesgen Hailemariam Dadi, Enrico Siragusa, … Knut Reinert·BioinformaticsPeer-reviewed·Jul 5, 2018