{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:33:28Z","timestamp":1784903608935,"version":"3.55.0"},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p>Accurate selectivity estimation for string predicates is a long-standing research challenge in databases. Supporting pattern matching on strings (such as prefix, substring, and suffix) makes this problem much more challenging, thereby necessitating a dedicated study. Traditional approaches often build pruned summary data structures such as tries followed by selectivity estimation using statistical correlations. However, this produces insufficiently accurate cardinality estimates resulting in the selection of sub-optimal plans by the query optimizer. Recently proposed deep learning based approaches leverage techniques from natural language processing such as embeddings to encode the strings and use it to train a model. While this is an improvement over traditional approaches, there is a large scope for improvement.<\/jats:p>\n          <jats:p>We propose Astrid, a framework for string selectivity estimation that synthesizes ideas from traditional and deep learning based approaches. We make two complementary contributions. First, we propose an embedding algorithm that is query-type (prefix, substring, and suffix) and selectivity aware. Consider three strings 'ab', 'abc' and 'abd' whose prefix frequencies are 1000, 800 and 100 respectively. Our approach would ensure that the embedding for 'ab' is closer to 'abc' than 'abd'. Second, we describe how neural language models could be used for selectivity estimation. While they work well for prefix queries, their performance for substring queries is sub-optimal. We modify the objective function of the neural language model so that it could be used for estimating selectivities of pattern matching queries. We also propose a novel and efficient algorithm for optimizing the new objective function. We conduct extensive experiments over benchmark datasets and show that our proposed approaches achieve state-of-the-art results.<\/jats:p>","DOI":"10.14778\/3436905.3436907","type":"journal-article","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T17:23:50Z","timestamp":1614014630000},"page":"471-484","source":"Crossref","is-referenced-by-count":28,"title":["Astrid"],"prefix":"10.14778","volume":"14","author":[{"given":"Suraj","family":"Shetiya","sequence":"first","affiliation":[{"name":"UT Arlington"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[{"name":"QCRI, HBKU"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"UT Arlington"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/235809.235810"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944966"},{"key":"e_1_2_1_4_1","volume-title":"Enriching Word Vectors with Subword Information. arXiv preprint arXiv:1607.04606","author":"Bojanowski Piotr","year":"2016","unstructured":"Piotr Bojanowski , Edouard Grave , Armand Joulin , and Tomas Mikolov . 2016. Enriching Word Vectors with Subword Information. arXiv preprint arXiv:1607.04606 ( 2016 ). Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2016. Enriching Word Vectors with Subword Information. arXiv preprint arXiv:1607.04606 (2016)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007604"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375686"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389742"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978116"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/csla.1999.0128"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335225"},{"key":"e_1_2_1_11_1","volume-title":"Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio.","author":"Cho Kyunghyun","year":"2014","unstructured":"Kyunghyun Cho , Bart Van Merri\u00ebnboer , Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014 . Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014). Kyunghyun Cho, Bart Van Merri\u00ebnboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014)."},{"key":"e_1_2_1_12_1","volume-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555","author":"Chung Junyoung","year":"2014","unstructured":"Junyoung Chung , Caglar Gulcehre , KyungHyun Cho , and Yoshua Bengio . 2014. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555 ( 2014 ). Junyoung Chung, Caglar Gulcehre, KyungHyun Cho, and Yoshua Bengio. 2014. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555 (2014)."},{"key":"e_1_2_1_13_1","volume-title":"Edit Distance Embedding using Convolutional Neural Networks. arXiv preprint arXiv:2001.11692","author":"Dai Xinyan","year":"2020","unstructured":"Xinyan Dai , Xiao Yan , Kaiwen Zhou , Yuxuan Wang , Han Yang , and James Cheng . 2020. Edit Distance Embedding using Convolutional Neural Networks. arXiv preprint arXiv:2001.11692 ( 2020 ). Xinyan Dai, Xiao Yan, Kaiwen Zhou, Yuxuan Wang, Han Yang, and James Cheng. 2020. Edit Distance Embedding using Convolutional Neural Networks. arXiv preprint arXiv:2001.11692 (2020)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3329772.3329780"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3236187.3269461"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375727"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0090-4"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/270563.571472"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.100"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389741"},{"key":"e_1_2_1_21_1","unstructured":"Alexander Hermans Lucas Beyer and Bastian Leibe. 2017. In defense of the triplet loss for person re-identification. arXiv preprint arXiv:1703.07737 (2017).  Alexander Hermans Lucas Beyer and Bastian Leibe. 2017. In defense of the triplet loss for person re-identification. arXiv preprint arXiv:1703.07737 (2017)."},{"key":"e_1_2_1_22_1","volume-title":"DeepDB: Learn from Data, not from Queries! arXiv preprint arXiv:1909.00607","author":"Hilprecht Benjamin","year":"2019","unstructured":"Benjamin Hilprecht , Andreas Schmidt , Moritz Kulessa , Alejandro Molina , Kristian Kersting , and Carsten Binnig . 2019. DeepDB: Learn from Data, not from Queries! arXiv preprint arXiv:1909.00607 ( 2019 ). Benjamin Hilprecht, Andreas Schmidt, Moritz Kulessa, Alejandro Molina, Kristian Kersting, and Carsten Binnig. 2019. DeepDB: Learn from Data, not from Queries! arXiv preprint arXiv:1909.00607 (2019)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24261-3_7"},{"key":"e_1_2_1_25_1","unstructured":"Jeff Huang. 2020 (accessed Oct 02 2020). AOL Query Logs. https:\/\/jeffhuang.com\/search_query_logs\/  Jeff Huang. 2020 (accessed Oct 02 2020). AOL Query Logs. https:\/\/jeffhuang.com\/search_query_logs\/"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315455"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780000029"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304001"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671191"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0061-2"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045367"},{"key":"e_1_2_1_32_1","volume-title":"Speech & language processing","author":"Jurafsky Dan","unstructured":"Dan Jurafsky and James Martin . 2020. Speech & language processing . 3 rd Edition. Pearson . Dan Jurafsky and James Martin. 2020. Speech & language processing. 3rd Edition. Pearson.","edition":"3"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151112"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3016100.3016285"},{"key":"e_1_2_1_35_1","unstructured":"Andreas Kipf Michael Freitag Dimitri Vorona Peter Boncz Thomas Neumann and Alfons Kemper. [n.d.]. Estimating Filtered Group-By Queries is Hard: Deep Learning to the Rescue. ([n. d.]).  Andreas Kipf Michael Freitag Dimitri Vorona Peter Boncz Thomas Neumann and Alfons Kemper. [n.d.]. Estimating Filtered Group-By Queries is Hard: Deep Learning to the Rescue. ([n. d.])."},{"key":"e_1_2_1_36_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning. CIDR","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf , Thomas Kipf , Bernhard Radke , Viktor Leis , Peter Boncz , and Alfons Kemper . 2019 . Learned Cardinalities: Estimating Correlated Joins with Deep Learning. CIDR (2019). Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter Boncz, and Alfons Kemper. 2019. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. CIDR (2019)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.1999.787640"},{"key":"e_1_2_1_38_1","volume-title":"Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan.","author":"Kraska Tim","year":"2019","unstructured":"Tim Kraska , Mohammad Alizadeh , Alex Beutel , Ed H Chi , Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019 . Sagedb : A learned database system. (2019). Tim Kraska, Mohammad Alizadeh, Alex Beutel, Ed H Chi, Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019. Sagedb: A learned database system. (2019)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233341"},{"key":"e_1_2_1_41_1","volume-title":"Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan , Zongheng Yang , Ken Goldberg , Joseph Hellerstein , and Ion Stoica . 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 ( 2018 ). Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph Hellerstein, and Ion Stoica. 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 (2018)."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671200"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325877"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516455"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_46_1","unstructured":"Viktor Leis Bernharde Radke Andrey Gubichev Alfons Kemper and Thomas Neumann. 2017. Cardinality Estimation Done Right: Index-Based Join Sampling.. In CIDR.  Viktor Leis Bernharde Radke Andrey Gubichev Alfons Kemper and Thomas Neumann. 2017. Cardinality Estimation Done Right: Index-Based Join Sampling.. In CIDR."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325889"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/93605.93611"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3211954.3211957"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276344"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242529"},{"key":"e_1_2_1_53_1","volume-title":"Nitish Shirish Keskar, and Richard Socher","author":"Merity Stephen","year":"2017","unstructured":"Stephen Merity , Nitish Shirish Keskar, and Richard Socher . 2017 . Regularizing and optimizing LSTM language models. arXiv preprint arXiv:1708.02182 (2017). Stephen Merity, Nitish Shirish Keskar, and Richard Socher. 2017. Regularizing and optimizing LSTM language models. arXiv preprint arXiv:1708.02182 (2017)."},{"key":"e_1_2_1_54_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213882"},{"key":"e_1_2_1_56_1","unstructured":"Parimarjan Negi. 2020 (accessed May 1 2020). DB Embedding Tools. https:\/\/github.com\/parimarjan\/db-embedding-tools  Parimarjan Negi. 2020 (accessed May 1 2020). DB Embedding Tools. https:\/\/github.com\/parimarjan\/db-embedding-tools"},{"key":"e_1_2_1_57_1","unstructured":"NLTK. 2020 (accessed Oct 02 2020). NLTK Language Model. http:\/\/www.nltk.org\/api\/nltk.lm.html  NLTK. 2020 (accessed Oct 02 2020). NLTK Language Model. http:\/\/www.nltk.org\/api\/nltk.lm.html"},{"key":"e_1_2_1_58_1","volume-title":"Learning State Representations for Query Optimization with Deep Reinforcement Learning. arXiv preprint arXiv:1803.08604","author":"Ortiz Jennifer","year":"2018","unstructured":"Jennifer Ortiz , Magdalena Balazinska , Johannes Gehrke , and S Sathiya Keerthi . 2018. Learning State Representations for Query Optimization with Deep Reinforcement Learning. arXiv preprint arXiv:1803.08604 ( 2018 ). Jennifer Ortiz, Magdalena Balazinska, Johannes Gehrke, and S Sathiya Keerthi. 2018. Learning State Representations for Query Optimization with Deep Reinforcement Learning. arXiv preprint arXiv:1803.08604 (2018)."},{"key":"e_1_2_1_59_1","volume-title":"An Empirical Analysis of Deep Learning for Cardinality Estimation. arXiv preprint arXiv:1905.06425","author":"Ortiz Jennifer","year":"2019","unstructured":"Jennifer Ortiz , Magdalena Balazinska , Johannes Gehrke , and S Sathiya Keerthi . 2019. An Empirical Analysis of Deep Learning for Cardinality Estimation. arXiv preprint arXiv:1905.06425 ( 2019 ). Jennifer Ortiz, Magdalena Balazinska, Johannes Gehrke, and S Sathiya Keerthi. 2019. An Empirical Analysis of Deep Learning for Cardinality Estimation. arXiv preprint arXiv:1905.06425 (2019)."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts. 20--21","author":"Petri Matthias","year":"2016","unstructured":"Matthias Petri and Trevor Cohn . 2016 . Succinct Data Structures for NLP-at-Scale . In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts. 20--21 . Matthias Petri and Trevor Cohn. 2016. Succinct Data Structures for NLP-at-Scale. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts. 20--21."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233342"},{"key":"e_1_2_1_63_1","volume-title":"ML-AQP: Query-Driven Approximate Query Processing based on Machine Learning. arXiv preprint arXiv:2003.06613","author":"Savva Fotis","year":"2020","unstructured":"Fotis Savva , Christos Anagnostopoulos , and Peter Triantafillou . 2020. ML-AQP: Query-Driven Approximate Query Processing based on Machine Learning. arXiv preprint arXiv:2003.06613 ( 2020 ). Fotis Savva, Christos Anagnostopoulos, and Peter Triantafillou. 2020. ML-AQP: Query-Driven Approximate Query Processing based on Machine Learning. arXiv preprint arXiv:2003.06613 (2020)."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_2_1_66_1","volume-title":"An End-to-End Learning-based Cost Estimator. arXiv preprint arXiv:1906.02560","author":"Sun Ji","year":"2019","unstructured":"Ji Sun and Guoliang Li. 2019. An End-to-End Learning-based Cost Estimator. arXiv preprint arXiv:1906.02560 ( 2019 ). Ji Sun and Guoliang Li. 2019. An End-to-End Learning-based Cost Estimator. arXiv preprint arXiv:1906.02560 (2019)."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564741"},{"key":"e_1_2_1_68_1","volume-title":"Approximate Query Processing using Deep Generative Models. ICDE","author":"Thirumuruganathan Saravanan","year":"2020","unstructured":"Saravanan Thirumuruganathan , Shohedul Hasan , Nick Koudas , and Gautam Das . 2020. Approximate Query Processing using Deep Generative Models. ICDE ( 2020 ). Saravanan Thirumuruganathan, Shohedul Hasan, Nick Koudas, and Gautam Das. 2020. Approximate Query Processing using Deep Generative Models. ICDE (2020)."},{"key":"e_1_2_1_69_1","volume-title":"Data Curation with Deep Learning. EDBT","author":"Thirumuruganathan Saravanan","year":"2020","unstructured":"Saravanan Thirumuruganathan , Nan Tang , Mourad Ouzzani , and AnHai Doan . 2020. Data Curation with Deep Learning. EDBT ( 2020 ). Saravanan Thirumuruganathan, Nan Tang, Mourad Ouzzani, and AnHai Doan. 2020. Data Curation with Deep Learning. EDBT (2020)."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402724"},{"key":"e_1_2_1_71_1","volume-title":"A reinforcement learning approach for adaptive query processing. History","author":"Tzoumas Kostas","year":"2008","unstructured":"Kostas Tzoumas , Timos Sellis , and Christian S Jensen . 2008. A reinforcement learning approach for adaptive query processing. History ( 2008 ). Kostas Tzoumas, Timos Sellis, and Christian S Jensen. 2008. A reinforcement learning approach for adaptive query processing. History (2008)."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.180"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.541"},{"key":"e_1_2_1_74_1","volume-title":"NNCubes: Learned Structures for Visual Data Exploration. arXiv preprint arXiv:1808.08983","author":"Wang Zhe","year":"2018","unstructured":"Zhe Wang , Dylan Cashman , Mingwei Li , Jixian Li , Matthew Berger , Joshua A Levine , Remco Chang , and Carlos Scheidegger . 2018. NNCubes: Learned Structures for Visual Data Exploration. arXiv preprint arXiv:1808.08983 ( 2018 ). Zhe Wang, Dylan Cashman, Mingwei Li, Jixian Li, Matthew Berger, Joshua A Levine, Remco Chang, and Carlos Scheidegger. 2018. NNCubes: Learned Structures for Visual Data Exploration. arXiv preprint arXiv:1808.08983 (2018)."},{"key":"e_1_2_1_75_1","volume-title":"Proc. of Workshop on Information Quality for Information Systems (IQIS).","author":"Weis Melanie","year":"2006","unstructured":"Melanie Weis , Felix Naumann , and Franziska Brosy . 2006 . A duplicate detection benchmark for XML (and relational) data . In Proc. of Workshop on Information Quality for Information Systems (IQIS). Melanie Weis, Felix Naumann, and Franziska Brosy. 2006. A duplicate detection benchmark for XML (and relational) data. In Proc. of Workshop on Information Quality for Information Systems (IQIS)."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.309"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01231-1_5"},{"key":"e_1_2_1_81_1","volume-title":"Recurrent neural network regularization. arXiv preprint arXiv:1409.2329","author":"Zaremba Wojciech","year":"2014","unstructured":"Wojciech Zaremba , Ilya Sutskever , and Oriol Vinyals . 2014. Recurrent neural network regularization. arXiv preprint arXiv:1409.2329 ( 2014 ). Wojciech Zaremba, Ilya Sutskever, and Oriol Vinyals. 2014. Recurrent neural network regularization. arXiv preprint arXiv:1409.2329 (2014)."},{"key":"e_1_2_1_82_1","volume-title":"LAQP: Learning-based Approximate Query Processing. arXiv preprint arXiv:2003.02446","author":"Zhang Meifan","year":"2020","unstructured":"Meifan Zhang and Hongzhi Wang . 2020 . LAQP: Learning-based Approximate Query Processing. arXiv preprint arXiv:2003.02446 (2020). Meifan Zhang and Hongzhi Wang. 2020. LAQP: Learning-based Approximate Query Processing. arXiv preprint arXiv:2003.02446 (2020)."},{"key":"e_1_2_1_83_1","unstructured":"Xiyuan Zhang Yang Yuan and Piotr Indyk. 2019. Neural Embeddings for Nearest Neighbor Search Under Edit Distance.  Xiyuan Zhang Yang Yuan and Piotr Indyk. 2019. Neural Embeddings for Nearest Neighbor Search Under Edit Distance."},{"key":"e_1_2_1_84_1","volume-title":"Neural Network Distiller: A Python Package For DNN Compression Research. (October","author":"Zmora Neta","year":"2019","unstructured":"Neta Zmora , Guy Jacob , Lev Zlotnik , Bar Elharar , and Gal Novik . 2019. Neural Network Distiller: A Python Package For DNN Compression Research. (October 2019 ). https:\/\/arxiv.org\/abs\/1910.12232 Neta Zmora, Guy Jacob, Lev Zlotnik, Bar Elharar, and Gal Novik. 2019. Neural Network Distiller: A Python Package For DNN Compression Research. (October 2019). https:\/\/arxiv.org\/abs\/1910.12232"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3436905.3436907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:23:54Z","timestamp":1672223034000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3436905.3436907"}},"subtitle":["accurate selectivity estimation for string predicates using deep learning"],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":84,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.14778\/3436905.3436907"],"URL":"https:\/\/doi.org\/10.14778\/3436905.3436907","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}