{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:34Z","timestamp":1750221274793,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p>We present the ARCHIMEDES system for efficient query processing over probabilistic knowledge bases. We design ARCHIMEDES for knowledge bases containing incomplete and uncertain information due to limitations of information sources and human knowledge. Answering queries over these knowledge bases requires efficient probabilistic inference. In this paper, we describe ARCHIMEDES's efficient knowledge expansion and querydriven inference over UDA-GIST, an in-database unified data- and graph-parallel computation framework. With an efficient inference engine, ARCHIMEDES produces reasonable results for queries over large uncertain knowledge bases. We use the Reverb-Sherlock andWikilinks knowledge bases to show ARCHIMEDES achieves satisfactory quality with real-time performance.<\/jats:p>","DOI":"10.1145\/3137586.3137592","type":"journal-article","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T12:23:34Z","timestamp":1504614214000},"page":"30-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Archimedes"],"prefix":"10.1145","volume":"46","author":[{"given":"Yang","family":"Chen","sequence":"first","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Li","sequence":"additional","affiliation":[{"name":"Google, Inc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisy Zhe","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4302-1125-9_7"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882954"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610516"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0444-3"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_8_1","volume-title":"EMNLP","author":"Fader A.","year":"2011","unstructured":"A. Fader , S. Soderland , and O. Etzioni . Identifying relations for open information extraction . In EMNLP , 2011 . A. Fader, S. Soderland, and O. Etzioni. Identifying relations for open information extraction. In EMNLP, 2011."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0394-1"},{"key":"e_1_2_1_10_1","author":"Gatterbauer W.","year":"2016","unstructured":"W. Gatterbauer and D. Suciu . Dissociation and propagation for approximate lifted inference with standard relational database management systems. The VLDB Journal , 2016 . W. Gatterbauer and D. Suciu. Dissociation and propagation for approximate lifted inference with standard relational database management systems. The VLDB Journal, 2016.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_11_1","volume-title":"AISTATS","author":"Gonzalez J.","year":"2011","unstructured":"J. Gonzalez , Y. Low , A. Gretton , and C. Guestrin . Parallel gibbs sampling: From colored fields to thin junction trees . In AISTATS , 2011 . J. Gonzalez, Y. Low, A. Gretton, and C. Guestrin. Parallel gibbs sampling: From colored fields to thin junction trees. In AISTATS, 2011."},{"key":"e_1_2_1_12_1","volume-title":"AISTATS","author":"Gonzalez J.","year":"2009","unstructured":"J. Gonzalez , Y. Low , and C. Guestrin . Residual splash for optimally parallelizing belief propagation . In AISTATS , 2009 . J. Gonzalez, Y. Low, and C. Guestrin. Residual splash for optimally parallelizing belief propagation. In AISTATS, 2009."},{"key":"e_1_2_1_13_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . Graphx: Graph processing in a distributed dataflow framework . In OSDI , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. Graphx: Graph processing in a distributed dataflow framework. In OSDI, 2014."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904487"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367510"},{"key":"e_1_2_1_16_1","volume-title":"Probabilistic graphical models: principles and techniques","author":"Koller D.","year":"2009","unstructured":"D. Koller and N. Friedman . Probabilistic graphical models: principles and techniques . MIT press , 2009 . D. Koller and N. Friedman. Probabilistic graphical models: principles and techniques. MIT press, 2009."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735488"},{"key":"e_1_2_1_18_1","author":"Li K.","year":"2016","unstructured":"K. Li , X. Zhou , D. Z. Wang , C. Grant , A. Dobra , and C. Dudley . In-database batch and query-time inference over probabilistic graphical models using uda-gist. The VLDB Journal , 2016 . K. Li, X. Zhou, D. Z. Wang, C. Grant, A. Dobra, and C. Dudley. In-database batch and query-time inference over probabilistic graphical models using uda-gist. The VLDB Journal, 2016.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_20_1","volume-title":"CIDR","author":"Mahdisoltani F.","year":"2014","unstructured":"F. Mahdisoltani , J. Biega , and F. Suchanek . Yago3: A knowledge base from multilingual wikipedias . In CIDR , 2014 . F. Mahdisoltani, J. Biega, and F. Suchanek. Yago3: A knowledge base from multilingual wikipedias. In CIDR, 2014."},{"key":"e_1_2_1_21_1","volume-title":"AAAI","author":"Mitchell T.","year":"2015","unstructured":"T. Mitchell and et. al. Never-ending learning . In AAAI , 2015 . T. Mitchell and et. al. Never-ending learning. In AAAI, 2015."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"e_1_2_1_23_1","volume-title":"AAAI","author":"Poon H.","year":"2006","unstructured":"H. Poon and P. Domingos . Sound and efficient inference with probabilistic and deterministic dependencies . In AAAI , 2006 . H. Poon and P. Domingos. Sound and efficient inference with probabilistic and deterministic dependencies. In AAAI, 2006."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_2_1_25_1","volume-title":"EMNLP","author":"Schoenmackers S.","year":"2010","unstructured":"S. Schoenmackers , O. Etzioni , D. S. Weld , and J. Davis . Learning first-order horn clauses from web text . In EMNLP , 2010 . S. Schoenmackers, O. Etzioni, D. S. Weld, and J. Davis. Learning first-order horn clauses from web text. In EMNLP, 2010."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809991"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of ACL-HLT","author":"Singh S.","year":"2011","unstructured":"S. Singh , A. Subramanya , F. Pereira , and A. McCallum . Large-scale cross-document coreference using distributed inference and hierarchical models . In Proceedings of ACL-HLT , 2011 . S. Singh, A. Subramanya, F. Pereira, and A. McCallum. Large-scale cross-document coreference using distributed inference and hierarchical models. In Proceedings of ACL-HLT, 2011."},{"key":"e_1_2_1_29_1","volume-title":"McCallum. Wikilinks: A large-scale cross-document coreference corpus labeled via links to wikipedia","author":"Singh S.","year":"2012","unstructured":"S. Singh , A. Subramanya , F. Pereira , and A. McCallum. Wikilinks: A large-scale cross-document coreference corpus labeled via links to wikipedia . University of Massachusetts , Amherst, Tech . Rep., 2012 . S. Singh, A. Subramanya, F. Pereira, and A. McCallum. Wikilinks: A large-scale cross-document coreference corpus labeled via links to wikipedia. University of Massachusetts, Amherst, Tech. Rep., 2012."},{"key":"e_1_2_1_30_1","volume-title":"NIPS","author":"Wick M. L.","year":"2011","unstructured":"M. L. Wick and A. McCallum . Query-aware mcmc . In NIPS , 2011 . M. L. Wick and A. McCallum. Query-aware mcmc. In NIPS, 2011."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213891"},{"key":"e_1_2_1_32_1","volume-title":"NSDI","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In NSDI , 2012 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, 2012."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 2nd USENIX conference on Hot topics in cloud computing","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M. Chowdhury , M. J. Franklin , S. Shenker , and I. Stoica . Spark: cluster computing with working sets . In Proceedings of the 2nd USENIX conference on Hot topics in cloud computing , 2010 . M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: cluster computing with working sets. In Proceedings of the 2nd USENIX conference on Hot topics in cloud computing, 2010."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007284"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137586.3137592","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3137586.3137592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:10Z","timestamp":1750212670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3137586.3137592"}},"subtitle":["Efficient Query Processing over Probabilistic Knowledge Bases"],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1145\/3137586.3137592"],"URL":"https:\/\/doi.org\/10.1145\/3137586.3137592","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"2017-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}