{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:29:14Z","timestamp":1756571354677,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,14]],"date-time":"2017-05-14T00:00:00Z","timestamp":1494720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Google Faculty Research Award"],"award-info":[{"award-number":["Google Faculty Research Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1633629"],"award-info":[{"award-number":["IIS-1633629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,14]]},"DOI":"10.1145\/3068943.3068947","type":"proceedings-article","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T19:56:07Z","timestamp":1494964567000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Performance Prediction for Graph Queries"],"prefix":"10.1145","author":[{"given":"Mohammad Hossein","family":"Namaki","sequence":"first","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keyvan","family":"Sasani","sequence":"additional","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022689900470"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.64"},{"key":"e_1_3_2_1_3_1","volume-title":"An empirical study of real-world sparql queries","author":"Arias M.","year":"2011","unstructured":"M. Arias , J. D. Fernndez , M. A. Martnez-Prieto , and P. de la Fuente . An empirical study of real-world sparql queries . 2011 . M. Arias, J. D. Fernndez, M. A. Martnez-Prieto, and P. de la Fuente. An empirical study of real-world sparql queries. 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_5_1","volume-title":"Classification and regression trees","author":"Breiman L.","year":"1984","unstructured":"L. Breiman , J. Friedman , C. J. Stone , and R. A. Olshen . Classification and regression trees . 1984 . L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. Classification and regression trees. 1984."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989359"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610513"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.130"},{"key":"e_1_3_2_1_10_1","volume-title":"Adaptivity","author":"Guo Q.","year":"2010","unstructured":"Q. Guo , R. W. White , S. T. Dumais , J. Wang , and B. Anderson . Predicting query performance using query, result, and user interaction features . In Adaptivity , Personalization and Fusion of Heterogeneous Information , 2010 . Q. Guo, R. W. White, S. T. Dumais, J. Wang, and B. Anderson. Predicting query performance using query, result, and user interaction features. In Adaptivity, Personalization and Fusion of Heterogeneous Information, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAC.2008.12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2014.43"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871562"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350269"},{"key":"e_1_3_2_1_15_1","first-page":"431","volume-title":"NIPS","author":"Louppe G.","year":"2013","unstructured":"G. Louppe , L. Wehenkel , A. Sutera , and P. Geurts . Understanding variable importances in forests of randomized trees . In NIPS , pages 431 -- 439 , 2013 . G. Louppe, L. Wehenkel, A. Sutera, and P. Geurts. Understanding variable importances in forests of randomized trees. In NIPS, pages 431--439, 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465313"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095690"},{"key":"e_1_3_2_1_18_1","first-page":"454","volume-title":"D Bpedia SPARQL Benchmark -- Performance Assessment with Real Queries on Real Data","author":"Morsey M.","year":"2011","unstructured":"M. Morsey , J. Lehmann , S. Auer , and A.-C. Ngonga Ngomo . D Bpedia SPARQL Benchmark -- Performance Assessment with Real Queries on Real Data , pages 454 -- 469 . 2011 . M. Morsey, J. Lehmann, S. Auer, and A.-C. Ngonga Ngomo. D Bpedia SPARQL Benchmark -- Performance Assessment with Real Queries on Real Data, pages 454--469. 2011."},{"key":"e_1_3_2_1_19_1","volume-title":"ICAPS","author":"Namaki M. H.","year":"2017","unstructured":"M. H. Namaki , R. R. Chowdhury , M. R. Islam , J. R. Doppa , and Y. Wu . Learning to speed up query planning in graph databases . In ICAPS , 2017 . M. H. Namaki, R. R. Chowdhury, M. R. Islam, J. R. Doppa, and Y. Wu. Learning to speed up query planning in graph databases. In ICAPS, 2017."},{"key":"e_1_3_2_1_20_1","first-page":"2825","volume-title":"JMLR","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 , J. Vanderplas , A. Passos , D. Cournapeau , M. Brucher , M. Perrot , and E. Duchesnay . Scikit-learn: Machine learning in Python . JMLR , pages 2825 -- 2830 , 2011 . F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. JMLR, pages 2825--2830, 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367881"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841412"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.870050"},{"key":"e_1_3_2_1_24_1","volume-title":"Approximation algorithms","author":"Vazirani V. V.","year":"2013","unstructured":"V. V. Vazirani . Approximation algorithms . Springer Science & Business Media , 2013 . V. V. Vazirani. Approximation algorithms. Springer Science & Business Media, 2013."},{"key":"e_1_3_2_1_25_1","volume-title":"Applications, basics, and computing of exploratory data analysis","author":"Velleman P. F.","year":"1981","unstructured":"P. F. Velleman and D. C. Hoaglin . Applications, basics, and computing of exploratory data analysis . 1981 . P. F. Velleman and D. C. Hoaglin. Applications, basics, and computing of exploratory data analysis. 1981."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544899"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_90"},{"key":"e_1_3_2_1_28_1","volume-title":"Fast top-k search in knowledge graphs","author":"Yang S.","year":"2016","unstructured":"S. Yang , F. Han , Y. Wu , and X. Yan . Fast top-k search in knowledge graphs . 2016 . S. Yang, F. Han, Y. Wu, and X. Yan. Fast top-k search in knowledge graphs. 2016."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732293"},{"key":"e_1_3_2_1_30_1","first-page":"289","volume-title":"VLDB","author":"Zhang N.","year":"2005","unstructured":"N. Zhang , P. J. Haas , V. Josifovski , G. M. Lohman , and C. Zhang . Statistical learning techniques for costing xml queries . In VLDB , pages 289 -- 300 , 2005 . N. Zhang, P. J. Haas, V. Josifovski, G. M. Lohman, and C. Zhang. Statistical learning techniques for costing xml queries. In VLDB, pages 289--300, 2005."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS'17"},"container-title":["Proceedings of the 2nd International Workshop on Network Data Analytics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3068943.3068947","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3068943.3068947","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3068943.3068947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:26Z","timestamp":1750217426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3068943.3068947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,14]]},"references-count":30,"alternative-id":["10.1145\/3068943.3068947","10.1145\/3068943"],"URL":"https:\/\/doi.org\/10.1145\/3068943.3068947","relation":{},"subject":[],"published":{"date-parts":[[2017,5,14]]},"assertion":[{"value":"2017-05-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}