{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:58Z","timestamp":1750307518327,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"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":[],"published-print":{"date-parts":[[2009,6,29]]},"DOI":"10.1145\/1559845.1559964","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"995-998","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Large-scale uncertainty management systems"],"prefix":"10.1145","author":[{"given":"Shivnath","family":"Babu","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC, USA"}]},{"given":"Sudipto","family":"Guha","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"263","volume-title":"COLT","author":"Abernethy J.","year":"2008","unstructured":"J. Abernethy , E. Hazan , and A. Rakhlin . Competing in the dark: An efficient algorithm for bandit linear optimization . In COLT , pages 263 -- 274 , 2008 . J. Abernethy, E. Hazan, and A. Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In COLT, pages 263--274, 2008."},{"key":"e_1_3_2_1_2_1","first-page":"1164","volume-title":"Annual ACM-SIAM Symp. on Discrete Algorithms","author":"Anthony B.M.","year":"2008","unstructured":"B.M. Anthony , V. Goyal , A. Gupta , and V. Nagarajan . A plant location guide for the unsure . Annual ACM-SIAM Symp. on Discrete Algorithms , pages 1164 -- 1173 , 2008 . B.M. Anthony, V. Goyal, A. Gupta, and V. Nagarajan. A plant location guide for the unsure. Annual ACM-SIAM Symp. on Discrete Algorithms, pages 1164--1173, 2008."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. Hot Topics in Autonomic Computing (HotAC III)","author":"Babu S.","year":"2008","unstructured":"S. Babu . Grand challenge : Experiment-driven adaptive systems . In Proc. Hot Topics in Autonomic Computing (HotAC III) , 2008 . S. Babu. Grand challenge: Experiment-driven adaptive systems. In Proc. Hot Topics in Autonomic Computing (HotAC III), 2008."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of Workshop on Hot Topics in Operating Systems (HotOS)","author":"Babu S.","year":"2009","unstructured":"S. Babu , N. Borisov , S. Duan , H. Herodotou , and V. Thummala . Automated experiment-driven management of (database) systems . In Proceedings of Workshop on Hot Topics in Operating Systems (HotOS) , 2009 . S. Babu, N. Borisov, S. Duan, H. Herodotou, and V. Thummala. Automated experiment-driven management of (database) systems. In Proceedings of Workshop on Hot Topics in Operating Systems (HotOS), 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.115"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007615"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376944"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316741"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1145\/1286380","volume-title":"Proc VLDB","author":"Deshpande A.","year":"2007","unstructured":"A. Deshpande and S. Sarawagi . Probabilistic graphical models and their role in databases . Proc VLDB , pages 1435 -- 1436 , 2007 . A. Deshpande and S. Sarawagi. Probabilistic graphical models and their role in databases. Proc VLDB, pages 1435--1436, 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"VLDB","author":"Duan S.","year":"2007","unstructured":"S. Duan and S. Babu . Processing forecasting queries . VLDB , 2007 . S. Duan and S. Babu. Processing forecasting queries. VLDB, 2007."},{"key":"e_1_3_2_1_15_1","volume-title":"SODA","author":"Flaxman A.","year":"2005","unstructured":"A. Flaxman , A. Kalai , and H.B. McMahan . Online convex optimization in the bandit setting: Gradient descent without a gradient . In SODA , 2005 . A. Flaxman, A. Kalai, and H.B. McMahan. Online convex optimization in the bandit setting: Gradient descent without a gradient. In SODA, 2005."},{"key":"e_1_3_2_1_16_1","volume-title":"A dynamic allocation index for the sequential design of experiments. Progress in statistics (European Meeting of Statisticians)","author":"Gittins J.C.","year":"1972","unstructured":"J.C. Gittins and D.M. Jones . A dynamic allocation index for the sequential design of experiments. Progress in statistics (European Meeting of Statisticians) , 1972 . J.C. Gittins and D.M. Jones. A dynamic allocation index for the sequential design of experiments. Progress in statistics (European Meeting of Statisticians), 1972."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142380"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250807"},{"key":"e_1_3_2_1_19_1","volume-title":"SODA","author":"Guha S.","year":"2007","unstructured":"S. Guha and K. Munagala . Model-driven optimization using adaptive probes . In SODA , 2007 . S. Guha and K. Munagala. Model-driven optimization using adaptive probes. In SODA, 2007."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559836"},{"key":"e_1_3_2_1_21_1","volume-title":"Information acquisition and exploitation in multi-channel wireless systems. CoRR: 0804.1724","author":"Guha S.","year":"2008","unstructured":"S. Guha , K. Munagala , and S. Sarkar . Information acquisition and exploitation in multi-channel wireless systems. CoRR: 0804.1724 , 2008 . S. Guha, K. Munagala, and S. Sarkar. Information acquisition and exploitation in multi-channel wireless systems. CoRR: 0804.1724, 2008."},{"key":"e_1_3_2_1_22_1","volume-title":"Approximation algorithms for restless bandit problems. CoRR: 0711.3861","author":"Guha S.","year":"2008","unstructured":"S. Guha , K. Munagala , and P. Shi . Approximation algorithms for restless bandit problems. CoRR: 0711.3861 , 2008 . S. Guha, K. Munagala, and P. Shi. Approximation algorithms for restless bandit problems. CoRR: 0711.3861, 2008."},{"key":"e_1_3_2_1_23_1","first-page":"965","volume-title":"VLDB","author":"Gupta R.","year":"2006","unstructured":"R. Gupta and S. Sarawagi . Creating probabilistic databases from information extraction models . VLDB , pages 965 -- 976 , 2006 . R. Gupta and S. Sarawagi. Creating probabilistic databases from information extraction models. VLDB, pages 965--976, 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329142"},{"key":"e_1_3_2_1_26_1","volume-title":"UAI","author":"Krause A.","year":"2005","unstructured":"A. Krause and C. Guestrin . Near-optimal nonmyopic value of information in graphical models . UAI , 2005 . A. Krause and C. Guestrin. Near-optimal nonmyopic value of information in graphical models. UAI, 2005."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127782"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.28"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_32_1","first-page":"1065","volume-title":"NIPS","author":"Pandey S.","year":"2006","unstructured":"S. Pandey and C. Olston . Handling advertisements of unknown quality in search advertising . In NIPS , pages 1065 -- 1072 , 2006 . S. Pandey and C. Olston. Handling advertisements of unknown quality in search advertising. In NIPS, pages 1065--1072, 2006."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. NIPS","author":"Sarawagi S.","year":"2004","unstructured":"S. Sarawagi and W.W. Cohen . Semi-Markov conditional random fields for information extraction . Proc. NIPS , 2004 . S. Sarawagi and W.W. Cohen. Semi-Markov conditional random fields for information extraction. Proc. NIPS, 2004."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401916"},{"key":"e_1_3_2_1_36_1","first-page":"535","volume-title":"VLDB","author":"Shivam P.","year":"2006","unstructured":"P. Shivam , S. Babu , and J.S. Chase . Active and accelerated learning of cost models for optimizing scientific applications . In VLDB , pages 535 -- 546 , 2006 . P. Shivam, S. Babu, and J.S. Chase. Active and accelerated learning of cost models for optimizing scientific applications. In VLDB, pages 535--546, 2006."},{"key":"e_1_3_2_1_37_1","volume-title":"VLDB","author":"Silberstein A.","year":"2007","unstructured":"A. Silberstein , K. Munagala , A. Gelfand , G. Puggioni , and J. Yang . Suppression and failures in sensor networks: A Bayesian approach . VLDB , 2007 . A. Silberstein, K. Munagala, A. Gelfand, G. Puggioni, and J. Yang. Suppression and failures in sensor networks: A Bayesian approach. VLDB, 2007."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/773301"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065199"},{"key":"e_1_3_2_1_40_1","volume-title":"VLDB","author":"Srivastava U.","year":"2006","unstructured":"U. Srivastava , K. Munagala , J. Widom , and R. Motwani . Query optimization over web services . In VLDB , 2006 . U. Srivastava, K. Munagala, J. Widom, and R. Motwani. Query optimization over web services. In VLDB, 2006."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2008.4770581"},{"key":"e_1_3_2_1_42_1","volume-title":"Restless bandits: Activity allocation in a changing world. Appl. Prob., 25(A):287--298","author":"Whittle P.","year":"1988","unstructured":"P. Whittle . Restless bandits: Activity allocation in a changing world. Appl. Prob., 25(A):287--298 , 1988 . P. Whittle. Restless bandits: Activity allocation in a changing world. Appl. Prob., 25(A):287--298, 1988."},{"key":"e_1_3_2_1_43_1","first-page":"928","volume-title":"Proceedings of ICML","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . Proceedings of ICML , pages 928 -- 936 , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. Proceedings of ICML, pages 928--936, 2003."}],"event":{"name":"SIGMOD\/PODS '09: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Providence Rhode Island USA","acronym":"SIGMOD\/PODS '09"},"container-title":["Proceedings of the 2009 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559845.1559964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:12Z","timestamp":1750249092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559964"}},"subtitle":["learning and exploiting your data"],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":42,"alternative-id":["10.1145\/1559845.1559964","10.1145\/1559845"],"URL":"https:\/\/doi.org\/10.1145\/1559845.1559964","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}