{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T02:36:21Z","timestamp":1768703781295,"version":"3.49.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["3.47E+12"],"award-info":[{"award-number":["3.47E+12"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>This article describes query processing in the DBO database system. Like other database systems designed for ad hoc analytic processing, DBO is able to compute the exact answers to queries over a large relational database in a scalable fashion. Unlike any other system designed for analytic processing, DBO can constantly maintain a guess as to the final answer to an aggregate query throughout execution, along with statistically meaningful bounds for the guess's accuracy. As DBO gathers more and more information, the guess gets more and more accurate, until it is 100% accurate as the query is completed. This allows users to stop the execution as soon as they are happy with the query accuracy, and thus encourages exploratory data analysis.<\/jats:p>","DOI":"10.1145\/1412331.1412335","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"1-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Scalable approximate query processing with the DBO engine"],"prefix":"10.1145","volume":"33","author":[{"given":"Chris","family":"Jermaine","sequence":"first","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subramanian","family":"Arumugam","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhijit","family":"Pol","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alin","family":"Dobra","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304207"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645918.672499"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304206"},{"key":"e_1_2_1_4_1","volume-title":"Sampling Techniques","author":"Cochran W. G.","unstructured":"Cochran , W. G. 1977. Sampling Techniques , 3 rd Edition. John Wiley . Cochran, W. G. 1977. Sampling Techniques, 3rd Edition. John Wiley.","edition":"3"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 28th International Conference on Very Large Databases (VLDB'02)","author":"Dittrich J.-P.","unstructured":"Dittrich , J.-P. , Seeger , B. , Taylor , D. S. , and Widmayer , P . 2002. Progressive merge join: a generic and non-blocking sort-based join algorithm . In Proceedings of the 28th International Conference on Very Large Databases (VLDB'02) , Hong Kong, China, VLDB Endowment, 299--310. Dittrich, J.-P., Seeger, B., Taylor, D. S., and Widmayer, P. 2002. Progressive merge join: a generic and non-blocking sort-based join algorithm. In Proceedings of the 28th International Conference on Very Large Databases (VLDB'02), Hong Kong, China, VLDB Endowment, 299--310."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773167"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065196"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646496.695465"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0041"},{"key":"e_1_2_1_11_1","unstructured":"Hardy G. Littlewood J. and Polya G. 1988. Inequalities. Cambridge University Press.  Hardy G. Littlewood J. and Polya G. 1988. Inequalities. Cambridge University Press."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781635"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253291"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247560"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066222"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases (VLDB)","author":"Jermaine C.","unstructured":"Jermaine , C. , Dobra , A. , Pol , A. , and Joshi , S . 2005b. Online estimation for subset-based sql queries . In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB) . Trondheim, Norway. VLDB Endowment, 745--756. Jermaine, C., Dobra, A., Pol, A., and Joshi, S. 2005b. Online estimation for subset-based sql queries. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB). Trondheim, Norway. VLDB Endowment, 745--756."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564721"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 15th International Conference on Very Large Data Bases (VLDB)","author":"Olken F.","unstructured":"Olken , F. and Rotem , D . 1989. Random sampling from b+ trees . In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB) . Amsterdam, The Netherlands. Morgan Kaufmann, San Francisco, CA, 269--277. Olken, F. and Rotem, D. 1989. Random sampling from b+ trees. In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB). Amsterdam, The Netherlands. Morgan Kaufmann, San Francisco, CA, 269--277."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 8th International Conference on Data Engineering (ICDE), IEEE Computer Society, 410--417","author":"\u00d6zsoyoglu G.","unstructured":"\u00d6zsoyoglu , G. , Du , K. , Swamy , S. G. , and Hou , W . -C. 1992. Processing real-time, non-aggregate queries with time-constraints in case-db . In Proceedings of the 8th International Conference on Data Engineering (ICDE), IEEE Computer Society, 410--417 . \u00d6zsoyoglu, G., Du, K., Swamy, S. G., and Hou, W.-C. 1992. Processing real-time, non-aggregate queries with time-constraints in case-db. In Proceedings of the 8th International Conference on Data Engineering (ICDE), IEEE Computer Society, 410--417."},{"key":"e_1_2_1_21_1","volume-title":"Mathematical Statistics","author":"Shao J.","unstructured":"Shao , J. 1999. Mathematical Statistics . Springer-Verlag . Shao, J. 1999. Mathematical Statistics. Springer-Verlag."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/6314.6315"},{"key":"e_1_2_1_23_1","volume-title":"Separable Programming. Applied Optimization","author":"Stefanov S.","unstructured":"Stefanov , S. 2001. Separable Programming. Applied Optimization , vol. 53 . Kluwer Academic Publishers . Stefanov, S. 2001. Separable Programming. Applied Optimization, vol. 53. Kluwer Academic Publishers."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304199"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1412331.1412335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1412331.1412335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:48:51Z","timestamp":1750286931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1412331.1412335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1412331.1412335"],"URL":"https:\/\/doi.org\/10.1145\/1412331.1412335","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}