{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:59:24Z","timestamp":1709819964852},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>Strings and applications using them are proliferating in science and business. Currently, strings are stored in file systems and processed using ad-hoc procedural code. Existing techniques are not flexible and cannot efficiently handle complex queries or large datasets. In this paper, we demonstrate StarDB, a distributed database system for analytics on strings. StarDB hides data and system complexities and allows users to focus on analytics. It uses a comprehensive set of parallel string operations and provides a declarative query language to solve complex queries. StarDB automatically tunes itself and runs with over 90% efficiency on supercomputers, public clouds, clusters, and workstations. We test StarDB using real datasets that are 2 orders of magnitude larger than the datasets reported by previous works.<\/jats:p>","DOI":"10.14778\/2824032.2824082","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"1844-1847","source":"Crossref","is-referenced-by-count":3,"title":["StarDB"],"prefix":"10.14778","volume":"8","author":[{"given":"Majed","family":"Sahli","sequence":"first","affiliation":[{"name":"King Abdullah University for Science &amp; Technology, Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Essam","family":"Mansour","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[{"name":"King Abdullah University for Science &amp; Technology, Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.123"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2006.01.003"},{"key":"e_1_2_1_3_1","volume-title":"Proc. of SAC","author":"Carvalho A. M.","year":"2004","unstructured":"A. M. Carvalho , A. L. Oliveira , A. T. Freitas , and M.-F. Sagot . A parallel algorithm for the extraction of structured motifs . In Proc. of SAC , 2004 . 10.1145\/967900.967932 A. M. Carvalho, A. L. Oliveira, A. T. Freitas, and M.-F. Sagot. A parallel algorithm for the extraction of structured motifs. In Proc. of SAC, 2004. 10.1145\/967900.967932"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.69"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511844409","volume-title":"Data-intensive computing: architectures, algorithms, and applications","author":"Gorton I.","year":"2012","unstructured":"I. Gorton and D. K. Gracio . Data-intensive computing: architectures, algorithms, and applications . Cambridge University Press , 2012 . I. Gorton and D. K. Gracio. Data-intensive computing: architectures, algorithms, and applications. Cambridge University Press, 2012."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"Gusfield D.","year":"1997","unstructured":"D. Gusfield . Algorithms on strings, trees, and sequences: computer science and computational biology . 1997 . D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. 1997."},{"key":"e_1_2_1_7_1","volume-title":"Proc. of INDIACom.","author":"Mathur A.","unstructured":"A. Mathur , A. Sihag , E. Bagaria , S. Rajawat , A new perspective to data processing: Big data . In Proc. of INDIACom. A. Mathur, A. Sihag, E. Bagaria, S. Rajawat, et al. A new perspective to data processing: Big data. In Proc. of INDIACom."},{"key":"e_1_2_1_8_1","volume-title":"Proc. of ICDE","author":"Sahli M.","year":"2015","unstructured":"M. Sahli , E. Mansour , T. Alturkestani , and P. Kalnis . Automatic tuning of bag-of-tasks application . In Proc. of ICDE , April 2015 . M. Sahli, E. Mansour, T. Alturkestani, and P. Kalnis. Automatic tuning of bag-of-tasks application. In Proc. of ICDE, April 2015."},{"key":"e_1_2_1_9_1","volume-title":"Proc. of CIKM. 10","author":"Sahli M.","unstructured":"M. Sahli , E. Mansour , and P. Kalnis . Parallel motif extraction from very long sequences . In Proc. of CIKM. 10 .1145\/2505515.2505575 M. Sahli, E. Mansour, and P. Kalnis. Parallel motif extraction from very long sequences. In Proc. of CIKM. 10.1145\/2505515.2505575"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0370-1"},{"key":"e_1_2_1_11_1","volume-title":"Proc. of VLDB","author":"Tata S.","year":"2007","unstructured":"S. Tata , W. Lang , and J. M. Patel . Periscope\/SQ: Interactive exploration of biological sequence databases . In Proc. of VLDB , 2007 . S. Tata, W. Lang, and J. M. Patel. Periscope\/SQ: Interactive exploration of biological sequence databases. In Proc. of VLDB, 2007."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:05:27Z","timestamp":1672221927000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824082"}},"subtitle":["a large-scale DBMS for strings"],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824082"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824082","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}