{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:02:08Z","timestamp":1772042528479,"version":"3.50.1"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>\n            Machine learning has become an essential toolkit for complex analytic processing. Data is typically stored in large data warehouses with multiple dimension hierarchies. Often, data used for building an ML model are aligned on OLAP hierarchies such as location or time. In this paper, we investigate the feasibility of efficiently constructing approximate ML models for new queries from previously constructed ML models by leveraging the concepts of\n            <jats:italic>model materialization<\/jats:italic>\n            and\n            <jats:italic>reuse<\/jats:italic>\n            . For example, is it possible to construct an approximate ML model for data from the year 2017 if one already has ML models for each of its quarters? We propose algorithms that can support a wide variety of ML models such as generalized linear models for classification along with K-Means and Gaussian Mixture models for clustering. We propose a cost based optimization framework that identifies appropriate ML models to combine at query time and conduct extensive experiments on real-world and synthetic datasets. Our results indicate that our framework can support analytic queries on ML models, with superior performance, achieving dramatic speedups of several orders in magnitude on very large datasets.\n          <\/jats:p>","DOI":"10.14778\/3236187.3236199","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1468-1481","source":"Crossref","is-referenced-by-count":7,"title":["Efficient construction of approximate ad-hoc ML models through materialization and reuse"],"prefix":"10.14778","volume":"11","author":[{"given":"Sona","family":"Hasani","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington and University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abolfazl","family":"Asudeh","sequence":"additional","affiliation":[{"name":"University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"275","volume-title":"ACM SIGMOD Record","author":"Acharya S.","year":"1999","unstructured":"S. Acharya , P. B. Gibbons , V. Poosala , and S. Ramaswamy . Join synopses for approximate query answering . In ACM SIGMOD Record , volume 28 , pages 275 -- 286 . ACM , 1999 . S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In ACM SIGMOD Record, volume 28, pages 275--286. ACM, 1999."},{"key":"e_1_2_1_2_1","volume-title":"Geometric approximation via coresets. Combinatorial and computational geometry, 52:1--30","author":"Agarwal P. K.","year":"2005","unstructured":"P. K. Agarwal , S. Har-Peled , and K. R. Varadarajan . Geometric approximation via coresets. Combinatorial and computational geometry, 52:1--30 , 2005 . P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets. Combinatorial and computational geometry, 52:1--30, 2005."},{"key":"e_1_2_1_3_1","volume-title":"Accessed","author":"Ailon N.","year":"2018","unstructured":"N. Ailon , R. Jaiswal , and C. Monteleoni . Streaming k-means approximation. http: \/\/www.cs.columbia.edu\/~rjaiswal\/ajmNIPS09.pdf . Accessed : Jul 20, 2018 . N. Ailon, R. Jaiswal, and C. Monteleoni. Streaming k-means approximation. http: \/\/www.cs.columbia.edu\/~rjaiswal\/ajmNIPS09.pdf. Accessed: Jul 20, 2018."},{"key":"e_1_2_1_4_1","first-page":"10","volume-title":"NIPS","author":"Ailon N.","year":"2009","unstructured":"N. Ailon , R. Jaiswal , and C. Monteleoni . Streaming k-means approximation . In NIPS , pages 10 -- 18 , 2009 . N. Ailon, R. Jaiswal, and C. Monteleoni. Streaming k-means approximation. In NIPS, pages 10--18, 2009."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.111"},{"key":"e_1_2_1_6_1","first-page":"1027","volume-title":"SODA","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . k-means++: The advantages of careful seeding . In SODA , pages 1027 -- 1035 . SIAM , 2007 . D. Arthur and S. Vassilvitskii. k-means++: The advantages of careful seeding. In SODA, pages 1027--1035. SIAM, 2007."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872822"},{"key":"e_1_2_1_8_1","volume-title":"Scalable and distributed clustering via lightweight coresets. arXiv preprint arXiv:1702.08248","author":"Bachem O.","year":"2017","unstructured":"O. Bachem , M. Lucic , and A. Krause . Scalable and distributed clustering via lightweight coresets. arXiv preprint arXiv:1702.08248 , 2017 . O. Bachem, M. Lucic, and A. Krause. Scalable and distributed clustering via lightweight coresets. arXiv preprint arXiv:1702.08248, 2017."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011224019249"},{"key":"e_1_2_1_10_1","volume-title":"Training support vector machines using coresets. arXiv preprint arXiv:1708.03835","author":"Baykal C.","year":"2017","unstructured":"C. Baykal , L. Liebenwein , and W. Schwarting . Training support vector machines using coresets. arXiv preprint arXiv:1708.03835 , 2017 . C. Baykal, L. Liebenwein, and W. Schwarting. Training support vector machines using coresets. arXiv preprint arXiv:1708.03835, 2017."},{"key":"e_1_2_1_11_1","volume-title":"Pattern recognition and machine learning. springer","author":"Bishop C. M.","year":"2006","unstructured":"C. M. Bishop . Pattern recognition and machine learning. springer , 2006 . C. M. Bishop. Pattern recognition and machine learning. springer, 2006."},{"key":"e_1_2_1_12_1","volume-title":"Libsvm: a library for support vector machines. ACM transactions on intelligent systems and technology (TIST), 2(3):27","author":"Chang C.-C.","year":"2011","unstructured":"C.-C. Chang and C.-J. Lin . Libsvm: a library for support vector machines. ACM transactions on intelligent systems and technology (TIST), 2(3):27 , 2011 . C.-C. Chang and C.-J. Lin. Libsvm: a library for support vector machines. ACM transactions on intelligent systems and technology (TIST), 2(3):27, 2011."},{"key":"e_1_2_1_13_1","first-page":"982","volume-title":"PVLDB","author":"Chen B.-C.","year":"2005","unstructured":"B.-C. Chen , L. Chen , Y. Lin , and R. Ramakrishnan . Prediction cubes . PVLDB , pages 982 -- 993 , 2005 . B.-C. Chen, L. Chen, Y. Lin, and R. Ramakrishnan. Prediction cubes. PVLDB, pages 982--993, 2005."},{"key":"e_1_2_1_14_1","first-page":"605","volume-title":"VISAPP (1)","author":"Declercq A.","year":"2008","unstructured":"A. Declercq and J. H. Piater . Online learning of gaussian mixture models-a two-level approach . In VISAPP (1) , pages 605 -- 611 , 2008 . A. Declercq and J. H. Piater. Online learning of gaussian mixture models-a two-level approach. In VISAPP (1), pages 605--611, 2008."},{"key":"e_1_2_1_15_1","volume-title":"Accessed","author":"Dheeru D.","year":"2018","unstructured":"D. Dheeru and E. Karra Taniskidou . UCI machine learning repository. https:\/\/archive.ics.uci.edu\/ml\/datasets.html, 2017 . Accessed : Jul 20, 2018 . D. Dheeru and E. Karra Taniskidou. UCI machine learning repository. https:\/\/archive.ics.uci.edu\/ml\/datasets.html, 2017. Accessed: Jul 20, 2018."},{"key":"e_1_2_1_16_1","first-page":"321","volume-title":"PVLDB","author":"Dong G.","year":"2001","unstructured":"G. Dong , J. Han , J. Lam , J. Pei , and K. Wang . Mining multi-dimensional constrained gradients in data cubes . PVLDB , pages 321 -- 330 , 2001 . G. Dong, J. Han, J. Lam, J. Pei, and K. Wang. Mining multi-dimensional constrained gradients in data cubes. PVLDB, pages 321--330, 2001."},{"key":"e_1_2_1_17_1","first-page":"2142","volume-title":"NIPS","author":"Feldman D.","year":"2011","unstructured":"D. Feldman , M. Faulkner , and A. Krause . Scalable training of mixture models via coresets . In NIPS , pages 2142 -- 2150 , 2011 . D. Feldman, M. Faulkner, and A. Krause. Scalable training of mixture models via coresets. In NIPS, pages 2142--2150, 2011."},{"key":"e_1_2_1_18_1","first-page":"1434","volume-title":"SODA","author":"Feldman D.","year":"2013","unstructured":"D. Feldman , M. Schmidt , and C. Sohler . Turning big data into tiny data: Constant-size coresets for k-means, pca and projective clustering . In SODA , pages 1434 -- 1453 . SIAM , 2013 . D. Feldman, M. Schmidt, and C. Sohler. Turning big data into tiny data: Constant-size coresets for k-means, pca and projective clustering. In SODA, pages 1434--1453. SIAM, 2013."},{"key":"e_1_2_1_19_1","first-page":"343","volume-title":"PVLDB","author":"Garofalakis M. N.","year":"2001","unstructured":"M. N. Garofalakis and P. B. Gibbons . Approximate query processing: Taming the terabytes . PVLDB , pages 343 -- 352 , 2001 . M. N. Garofalakis and P. B. Gibbons. Approximate query processing: Taming the terabytes. PVLDB, pages 343--352, 2001."},{"key":"e_1_2_1_20_1","volume-title":"Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data mining and knowledge discovery, 1(1):29--53","author":"Gray J.","year":"1997","unstructured":"J. Gray , S. Chaudhuri , A. Bosworth , A. Layman , D. Reichart , M. Venkatrao , F. Pellow , and H. Pirahesh . Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data mining and knowledge discovery, 1(1):29--53 , 1997 . J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data mining and knowledge discovery, 1(1):29--53, 1997."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198387"},{"key":"e_1_2_1_22_1","volume-title":"Processing analytical workloads incrementally. arXiv preprint arXiv:1509.05066","author":"Gupta P.","year":"2015","unstructured":"P. Gupta , N. Koudas , E. Shang , R. Johnson , and C. Zuzarte . Processing analytical workloads incrementally. arXiv preprint arXiv:1509.05066 , 2015 . P. Gupta, N. Koudas, E. Shang, R. Johnson, and C. Zuzarte. Processing analytical workloads incrementally. arXiv preprint arXiv:1509.05066, 2015."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2903730"},{"key":"e_1_2_1_24_1","volume-title":"Local uncertainty sampling for large-scale multi-class logistic regression. arXiv preprint arXiv:1604.08098","author":"Han L.","year":"2016","unstructured":"L. Han , T. Yang , and T. Zhang . Local uncertainty sampling for large-scale multi-class logistic regression. arXiv preprint arXiv:1604.08098 , 2016 . L. Han, T. Yang, and T. Zhang. Local uncertainty sampling for large-scale multi-class logistic regression. arXiv preprint arXiv:1604.08098, 2016."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367510"},{"key":"e_1_2_1_27_1","volume-title":"Methods for merging gaussian mixture components. Advances in data analysis and classification, 4(1):3--34","author":"Hennig C.","year":"2010","unstructured":"C. Hennig . Methods for merging gaussian mixture components. Advances in data analysis and classification, 4(1):3--34 , 2010 . C. Hennig. Methods for merging gaussian mixture components. Advances in data analysis and classification, 4(1):3--34, 2010."},{"key":"e_1_2_1_28_1","first-page":"4080","volume-title":"NIPS","author":"Huggins J.","year":"2016","unstructured":"J. Huggins , T. Campbell , and T. Broderick . Coresets for scalable bayesian logistic regression . In NIPS , pages 4080 -- 4088 , 2016 . J. Huggins, T. Campbell, and T. Broderick. Coresets for scalable bayesian logistic regression. In NIPS, pages 4080--4088, 2016."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064042"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3054775"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935694.2935698"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723713"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882952"},{"key":"e_1_2_1_34_1","volume-title":"Vowpal wabbit online learning project","author":"Langford J.","year":"2007","unstructured":"J. Langford , L. Li , and A. Strehl . Vowpal wabbit online learning project , 2007 . J. Langford, L. Li, and A. Strehl. Vowpal wabbit online learning project, 2007."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137812"},{"key":"e_1_2_1_36_1","first-page":"311","volume-title":"PVLDB","author":"Margaritis D.","year":"2001","unstructured":"D. Margaritis , C. Faloutsos , and S. Thrun . Netcube: A scalable tool for fast data mining and compression . PVLDB , pages 311 -- 320 , 2001 . D. Margaritis, C. Faloutsos, and S. Thrun. Netcube: A scalable tool for fast data mining and compression. PVLDB, pages 311--320, 2001."},{"key":"e_1_2_1_37_1","first-page":"456","volume-title":"NAACL","author":"McDonald R.","year":"2010","unstructured":"R. McDonald , K. Hall , and G. Mann . Distributed training strategies for the structured perceptron . In NAACL , pages 456 -- 464 . ACL, 2010 . R. McDonald, K. Hall, and G. Mann. Distributed training strategies for the structured perceptron. In NAACL, pages 456--464. ACL, 2010."},{"key":"e_1_2_1_38_1","first-page":"1231","volume-title":"NIPS","author":"Mcdonald R.","year":"2009","unstructured":"R. Mcdonald , M. Mohri , N. Silberman , D. Walker , and G. S. Mann . Efficient large-scale distributed training of conditional maximum entropy models . In NIPS , pages 1231 -- 1239 , 2009 . R. Mcdonald, M. Mohri, N. Silberman, D. Walker, and G. S. Mann. Efficient large-scale distributed training of conditional maximum entropy models. In NIPS, pages 1231--1239, 2009."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946679"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.192"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.112"},{"key":"e_1_2_1_42_1","volume-title":"Coreset based dependency networks. arXiv preprint arXiv:1710.03285","author":"Molina A.","year":"2017","unstructured":"A. Molina , A. Munteanu , and K. Kersting . Coreset based dependency networks. arXiv preprint arXiv:1710.03285 , 2017 . A. Molina, A. Munteanu, and K. Kersting. Coreset based dependency networks. arXiv preprint arXiv:1710.03285, 2017."},{"key":"e_1_2_1_43_1","volume-title":"Machine learning: a probabilistic perspective","author":"Murphy K. P.","year":"2012","unstructured":"K. P. Murphy . Machine learning: a probabilistic perspective . MIT press , 2012 . K. P. Murphy. Machine learning: a probabilistic perspective. MIT press, 2012."},{"key":"e_1_2_1_44_1","volume-title":"Hemingway: Modeling distributed optimization algorithms. arXiv preprint arXiv:1702.05865","author":"Pan X.","year":"2017","unstructured":"X. Pan , S. Venkataraman , Z. Tai , and J. Gonzalez . Hemingway: Modeling distributed optimization algorithms. arXiv preprint arXiv:1702.05865 , 2017 . X. Pan, S. Venkataraman, Z. Tai, and J. Gonzalez. Hemingway: Modeling distributed optimization algorithms. arXiv preprint arXiv:1702.05865, 2017."},{"key":"e_1_2_1_45_1","volume-title":"et al. Scikit-learn: Machine learning in python. JMLR, 12(Oct):2825--2830","author":"Pedregosa F.","year":"2011","unstructured":"F. Pedregosa , G. Varoquaux , A. Gramfort , V. Michel , B. Thirion , O. Grisel , M. Blondel , P. Prettenhofer , R. Weiss , V. Dubourg , et al. Scikit-learn: Machine learning in python. JMLR, 12(Oct):2825--2830 , 2011 . F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, et al. Scikit-learn: Machine learning in python. JMLR, 12(Oct):2825--2830, 2011."},{"key":"e_1_2_1_46_1","volume-title":"Improved coresets for kernel density estimates. arXiv preprint arXiv:1710.04325","author":"Phillips J. M.","year":"2017","unstructured":"J. M. Phillips and W. M. Tai . Improved coresets for kernel density estimates. arXiv preprint arXiv:1710.04325 , 2017 . J. M. Phillips and W. M. Tai. Improved coresets for kernel density estimates. arXiv preprint arXiv:1710.04325, 2017."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2007.4383588"},{"key":"e_1_2_1_48_1","first-page":"2375","volume-title":"NIPS","author":"Shindler M.","year":"2011","unstructured":"M. Shindler , A. Wong , and A. W. Meyerson . Fast and accurate k-means for large datasets . In NIPS , pages 2375 -- 2383 , 2011 . M. Shindler, A. Wong, and A. W. Meyerson. Fast and accurate k-means for large datasets. In NIPS, pages 2375--2383, 2011."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X132358"},{"key":"e_1_2_1_50_1","volume-title":"Transfer learning. Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods, and Techniques, 1:242","author":"Torrey L.","year":"2009","unstructured":"L. Torrey and J. Shavlik . Transfer learning. Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods, and Techniques, 1:242 , 2009 . L. Torrey and J. Shavlik. Transfer learning. Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods, and Techniques, 1:242, 2009."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273611"},{"key":"e_1_2_1_52_1","volume-title":"Core vector machines: Fast svm training on very large data sets. JMLR, 6(Apr):363--392","author":"Tsang I. W.","year":"2005","unstructured":"I. W. Tsang , J. T. Kwok , and P.-M. Cheung . Core vector machines: Fast svm training on very large data sets. JMLR, 6(Apr):363--392 , 2005 . I. W. Tsang, J. T. Kwok, and P.-M. Cheung. Core vector machines: Fast svm training on very large data sets. JMLR, 6(Apr):363--392, 2005."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196934"},{"key":"e_1_2_1_54_1","first-page":"14","volume-title":"Proceedings of the Workshop on Human-In-the-Loop Data Analytics","author":"Vartak M.","unstructured":"M. Vartak , H. Subramanyam , W.-E. Lee , S. Viswanathan , S. Husnoo , S. Madden , and M. Zaharia . Model db: a system for machine learning model management . In Proceedings of the Workshop on Human-In-the-Loop Data Analytics , page 14 . ACM, 2016. M. Vartak, H. Subramanyam, W.-E. Lee, S. Viswanathan, S. Husnoo, S. Madden, and M. Zaharia. Model db: a system for machine learning model management. In Proceedings of the Workshop on Human-In-the-Loop Data Analytics, page 14. ACM, 2016."},{"key":"e_1_2_1_55_1","first-page":"363","volume-title":"NSDI","author":"Venkataraman S.","year":"2016","unstructured":"S. Venkataraman , Z. Yang , M. J. Franklin , B. Recht , and I. Stoica . Ernest: Efficient performance prediction for large-scale advanced analytics . In NSDI , pages 363 -- 378 , 2016 . S. Venkataraman, Z. Yang, M. J. Franklin, B. Recht, and I. Stoica. Ernest: Efficient performance prediction for large-scale advanced analytics. In NSDI, pages 363--378, 2016."},{"key":"e_1_2_1_56_1","volume-title":"Materialization optimizations for feature selection workloads. ACM Transactions on Database Systems (TODS), 41(1):2","author":"Zhang C.","year":"2016","unstructured":"C. Zhang , A. Kumar , and C. R\u00e9 . Materialization optimizations for feature selection workloads. ACM Transactions on Database Systems (TODS), 41(1):2 , 2016 . C. Zhang, A. Kumar, and C. R\u00e9. Materialization optimizations for feature selection workloads. ACM Transactions on Database Systems (TODS), 41(1):2, 2016."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999134.2999302"},{"key":"e_1_2_1_58_1","first-page":"2595","volume-title":"NIPS","author":"Zinkevich M.","year":"2010","unstructured":"M. Zinkevich , M. Weimer , L. Li , and A. J. Smola . Parallelized stochastic gradient descent . In NIPS , pages 2595 -- 2603 , 2010 . M. Zinkevich, M. Weimer, L. Li, and A. J. Smola. Parallelized stochastic gradient descent. In NIPS, pages 2595--2603, 2010."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3236187.3236199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:40:21Z","timestamp":1672220421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3236187.3236199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":58,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["10.14778\/3236187.3236199"],"URL":"https:\/\/doi.org\/10.14778\/3236187.3236199","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}