{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:27:50Z","timestamp":1773278870768,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,7]]},"DOI":"10.1145\/3400903.3400907","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T21:20:29Z","timestamp":1596144029000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Search over Genomic Short Read Data"],"prefix":"10.1145","author":[{"given":"Wangda","family":"Zhang","sequence":"first","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengdi","family":"Lin","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth A.","family":"Ross","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Marina Barsky Ulrike Stege Alex Thomo and Chris Upton. 2009. Suffix trees for very large genomic sequences. In CIKM. ACM 1417\u20131420.  Marina Barsky Ulrike Stege Alex Thomo and Chris Upton. 2009. Suffix trees for very large genomic sequences. In CIKM. ACM 1417\u20131420.","DOI":"10.1145\/1645953.1646134"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059190"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2525401.2525407"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw543"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx639"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts173"},{"key":"e_1_3_2_1_7_1","volume-title":"Data structures and compression algorithms for high-throughput sequencing technologies. BMC bioinformatics 11, 1","author":"Daily Kenny","year":"2010","unstructured":"Kenny Daily , Paul Rigor , Scott Christley , Xiaohui Xie , and Pierre Baldi . 2010. Data structures and compression algorithms for high-throughput sequencing technologies. BMC bioinformatics 11, 1 ( 2010 ), 514. Kenny Daily, Paul Rigor, Scott Christley, Xiaohui Xie, and Pierre Baldi. 2010. Data structures and compression algorithms for high-throughput sequencing technologies. BMC bioinformatics 11, 1 (2010), 514."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-017-0254-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892127"},{"key":"e_1_3_2_1_11_1","volume-title":"Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome research 21, 5","author":"Hsi-Yang Fritz Markus","year":"2011","unstructured":"Markus Hsi-Yang Fritz , Rasko Leinonen , Guy Cochrane , and Ewan Birney . 2011. Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome research 21, 5 ( 2011 ), 734\u2013740. Markus Hsi-Yang Fritz, Rasko Leinonen, Guy Cochrane, and Ewan Birney. 2011. Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome research 21, 5 (2011), 734\u2013740."},{"key":"e_1_3_2_1_12_1","volume-title":"Disk-based compression of data from genome sequencing. Bioinformatics 31, 9","author":"Grabowski Szymon","year":"2014","unstructured":"Szymon Grabowski , Sebastian Deorowicz , and \u0141ukasz Roguski . 2014. Disk-based compression of data from genome sequencing. Bioinformatics 31, 9 ( 2014 ). Szymon Grabowski, Sebastian Deorowicz, and \u0141ukasz Roguski. 2014. Disk-based compression of data from genome sequencing. Bioinformatics 31, 9 (2014)."},{"key":"e_1_3_2_1_13_1","volume-title":"Modern B-tree techniques. Foundations and Trends\u00ae in Databases 3, 4","author":"Goetz Graefe","year":"2011","unstructured":"Goetz Graefe 2011. Modern B-tree techniques. Foundations and Trends\u00ae in Databases 3, 4 ( 2011 ), 203\u2013402. Goetz Graefe 2011. Modern B-tree techniques. Foundations and Trends\u00ae in Databases 3, 4 (2011), 203\u2013402."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw385"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"e_1_3_2_1_16_1","unstructured":"Karthik Gururaj Mishali and Naik. 2017. GenomicsDB : Storing Genome Data as Sparse Columnar Arrays.  Karthik Gururaj Mishali and Naik. 2017. GenomicsDB : Storing Genome Data as Sparse Columnar Arrays."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts593"},{"key":"e_1_3_2_1_18_1","volume-title":"LISA: Towards Learned DNA Sequence Search. arXiv preprint arXiv:1910.04728(2019).","author":"Ho Darryl","year":"2019","unstructured":"Darryl Ho , Jialin Ding , Sanchit Misra , Nesime Tatbul , Vikram Nathan , Vasimuddin Md , and Tim Kraska . 2019 . LISA: Towards Learned DNA Sequence Search. arXiv preprint arXiv:1910.04728(2019). Darryl Ho, Jialin Ding, Sanchit Misra, Nesime Tatbul, Vikram Nathan, Vasimuddin Md, and Tim Kraska. 2019. LISA: Towards Learned DNA Sequence Search. arXiv preprint arXiv:1910.04728(2019)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.160"},{"key":"e_1_3_2_1_20_1","volume-title":"BEETL-fastq: a searchable compressed archive for DNA reads. Bioinformatics 30, 19","author":"Janin Lilian","year":"2014","unstructured":"Lilian Janin , Ole Schulz-Trieglaff , and Anthony\u00a0 J Cox . 2014. BEETL-fastq: a searchable compressed archive for DNA reads. Bioinformatics 30, 19 ( 2014 ). Lilian Janin, Ole Schulz-Trieglaff, and Anthony\u00a0J Cox. 2014. BEETL-fastq: a searchable compressed archive for DNA reads. Bioinformatics 30, 19 (2014)."},{"key":"e_1_3_2_1_21_1","volume-title":"Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic acids research 40, 22","author":"Jones C","year":"2012","unstructured":"Daniel\u00a0 C Jones , Walter\u00a0 L Ruzzo , Xinxia Peng , and Michael\u00a0 G Katze . 2012. Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic acids research 40, 22 ( 2012 ), e171\u2013e171. Daniel\u00a0C Jones, Walter\u00a0L Ruzzo, Xinxia Peng, and Michael\u00a0G Katze. 2012. Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic acids research 40, 22 (2012), e171\u2013e171."},{"key":"e_1_3_2_1_22_1","volume-title":"Sapling: Accelerating Suffix Array Queries with Learned Data Models. BioRxiv","author":"Kirsche Melanie","year":"2020","unstructured":"Melanie Kirsche , Arun Das , and Michael Schatz . 2020 . Sapling: Accelerating Suffix Array Queries with Learned Data Models. BioRxiv (2020). Melanie Kirsche, Arun Das, and Michael Schatz. 2020. Sapling: Accelerating Suffix Array Queries with Learned Data Models. BioRxiv (2020)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt250"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw152"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448951"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty258"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx235"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv048"},{"key":"e_1_3_2_1_31_1","volume-title":"2016 USENIX Annual Technical Conference. 451","author":"Mitchell\u00a0Kate Montgomery Christopher","year":"2016","unstructured":"Christopher Mitchell\u00a0Kate Montgomery , Lamont Nelson , Siddhartha Sen , and Jinyang Li . 2016 . Balancing CPU and network in the cell distributed B-Tree store . In 2016 USENIX Annual Technical Conference. 451 . Christopher Mitchell\u00a0Kate Montgomery, Lamont Nelson, Siddhartha Sen, and Jinyang Li. 2016. Balancing CPU and network in the cell distributed B-Tree store. In 2016 USENIX Annual Technical Conference. 451."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt528"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.4037"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.170"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025117"},{"key":"e_1_3_2_1_36_1","volume-title":"Data-dependent bucketing improves reference-free compression of sequencing reads. Bioinformatics 31, 17","author":"Patro Rob","year":"2015","unstructured":"Rob Patro and Carl Kingsford . 2015. Data-dependent bucketing improves reference-free compression of sequencing reads. Bioinformatics 31, 17 ( 2015 ). Rob Patro and Carl Kingsford. 2015. Data-dependent bucketing improves reference-free compression of sequencing reads. Bioinformatics 31, 17 (2015)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jun Rao and Kenneth\u00a0A Ross. 2000. Making B+-trees cache conscious in main memory. In ACM SIGMOD Record Vol.\u00a029. ACM 475\u2013486.  Jun Rao and Kenneth\u00a0A Ross. 2000. Making B+-trees cache conscious in main memory. In ACM SIGMOD Record Vol.\u00a029. ACM 475\u2013486.","DOI":"10.1145\/335191.335449"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth408"},{"key":"e_1_3_2_1_39_1","volume-title":"Fast lossless compression via cascading Bloom filters. BMC bioinformatics 15, 9","author":"Rozov Roye","year":"2014","unstructured":"Roye Rozov , Ron Shamir , and Eran Halperin . 2014. Fast lossless compression via cascading Bloom filters. BMC bioinformatics 15, 9 ( 2014 ), S7. Roye Rozov, Ron Shamir, and Eran Halperin. 2014. Fast lossless compression via cascading Bloom filters. BMC bioinformatics 15, 9 (2014), S7."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_1_41_1","volume-title":"SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop. Bioinformatics 30, 1","author":"Schumacher Andr\u00e9","year":"2013","unstructured":"Andr\u00e9 Schumacher , Luca Pireddu , Matti Niemenmaa , Aleksi Kallio , Eija Korpelainen , Gianluigi Zanetti , and Keijo Heljanko . 2013. SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop. Bioinformatics 30, 1 ( 2013 ). Andr\u00e9 Schumacher, Luca Pireddu, Matti Niemenmaa, Aleksi Kallio, Eija Korpelainen, Gianluigi Zanetti, and Keijo Heljanko. 2013. SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop. Bioinformatics 30, 1 (2013)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.999958"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq217"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536265"},{"key":"e_1_3_2_1_45_1","volume-title":"CREST maps somatic structural variation in cancer genomes with base-pair resolution. Nature methods 8, 8","author":"Wang Jianmin","year":"2011","unstructured":"Jianmin Wang , Charles\u00a0 G Mullighan , John Easton , Stefan Roberts , Sue\u00a0 L Heatley , Jing Ma , Michael\u00a0 C Rusch , Ken Chen , Christopher\u00a0 C Harris , Li Ding , 2011. CREST maps somatic structural variation in cancer genomes with base-pair resolution. Nature methods 8, 8 ( 2011 ), 652. Jianmin Wang, Charles\u00a0G Mullighan, John Easton, Stefan Roberts, Sue\u00a0L Heatley, Jing Ma, Michael\u00a0C Rusch, Ken Chen, Christopher\u00a0C Harris, Li Ding, 2011. CREST maps somatic structural variation in cancer genomes with base-pair resolution. Nature methods 8, 8 (2011), 652."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu343"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Huanchen Zhang David\u00a0G Andersen Andrew Pavlo Michael Kaminsky Lin Ma and Rui Shen. 2016. Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In SIGMOD. ACM 1567\u20131581.  Huanchen Zhang David\u00a0G Andersen Andrew Pavlo Michael Kaminsky Lin Ma and Rui Shen. 2016. Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In SIGMOD. ACM 1567\u20131581.","DOI":"10.1145\/2882903.2915222"}],"event":{"name":"SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management","location":"Vienna Austria","acronym":"SSDBM 2020"},"container-title":["32nd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400903.3400907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:43Z","timestamp":1750199923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400903.3400907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,7]]},"references-count":47,"alternative-id":["10.1145\/3400903.3400907","10.1145\/3400903"],"URL":"https:\/\/doi.org\/10.1145\/3400903.3400907","relation":{},"subject":[],"published":{"date-parts":[[2020,7,7]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}