{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:33:57Z","timestamp":1764873237171},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T00:00:00Z","timestamp":1352246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00778-012-0293-7","type":"journal-article","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T08:52:24Z","timestamp":1352191944000},"page":"3-27","source":"Crossref","is-referenced-by-count":31,"title":["Efficiently adapting graphical models for selectivity estimation"],"prefix":"10.1007","volume":"22","author":[{"given":"Kostas","family":"Tzoumas","sequence":"first","affiliation":[]},{"given":"Amol","family":"Deshpande","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,7]]},"reference":[{"key":"293_CR1","doi-asserted-by":"crossref","unstructured":"Aboulnaga, A., Chaudhuri, S.: Self-tuning histograms: Building histograms without looking at data. In: SIGMOD, pp. 181\u2013192 (1999)","DOI":"10.1145\/304181.304198"},{"key":"293_CR2","doi-asserted-by":"crossref","unstructured":"Acharya, S., Gibbons, P.B., Poosala, V., Ramaswamy, S.: Join synopses for approximate query answering. In: SIGMOD, pp. 275\u2013286 (1999)","DOI":"10.1145\/304181.304207"},{"issue":"4","key":"293_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-004-1084-3","volume":"39","author":"A Berry","year":"2004","unstructured":"Berry, A., Blair, J.R.S., Heggernes, P., Peyton, B.W.: Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39(4), 287\u2013298 (2004)","journal-title":"Algorithmica"},{"key":"293_CR4","doi-asserted-by":"crossref","unstructured":"Bravo, H.C., Ramakrishnan, R.: Optimizing MPF queries: Decision support and probabilistic inference. In: SIGMOD, pp. 701\u2013712 (2007)","DOI":"10.1145\/1247480.1247558"},{"key":"293_CR5","doi-asserted-by":"crossref","unstructured":"Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: A multidimensional workload-aware histogram. In: SIGMOD, pp. 211\u2013222 (2001)","DOI":"10.1145\/376284.375686"},{"key":"293_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Motwani, R., Narasayya, V.R.: Random sampling for histogram construction: How much is enough? In: SIGMOD, pp. 436\u2013447 (1998)","DOI":"10.1145\/276305.276343"},{"key":"293_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Motwani, R., Narasayya, V.R.: On random sampling over joins. In: SIGMOD, pp. 263\u2013274 (1999)","DOI":"10.1145\/304181.304206"},{"issue":"2","key":"293_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/320248.320249","volume":"24","author":"S Chaudhuri","year":"1999","unstructured":"Chaudhuri, S., Shim, K.: Optimization of queries with user-defined predicates. ACM Trans. Database Syst. 24(2), 177\u2013228 (1999)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"293_CR9","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"CK Chow","year":"1968","unstructured":"Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory 14(3), 462\u2013V467 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"293_CR10","volume-title":"Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks","author":"RG Cowell","year":"1999","unstructured":"Cowell, R.G., Dawid, P., Lauritzen, S.L., Spiegelhalter, D.J.: Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks. Springer, Berlin (1999)"},{"key":"293_CR11","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Garofalakis, M.N., Rastogi, R.: Independence is good: dependency-based histogram synopses for high-dimensional data. In: SIGMOD, pp. 199\u2013210 (2001)","DOI":"10.1145\/376284.375685"},{"key":"293_CR12","unstructured":"Friedman, N., Goldszmidt, M.: Sequential update of bayesian network structure. In: UAI, pp. 165\u2013174 (1997)"},{"key":"293_CR13","unstructured":"Getoor, L.: Learning statistical models from relational data. Ph.D. thesis, Stanford University (2001)"},{"key":"293_CR14","doi-asserted-by":"crossref","unstructured":"Getoor, L., Taskar, B., Koller, D.: Selectivity estimation using probabilistic models. In: SIGMOD, pp. 461\u2013472 (2001)","DOI":"10.1145\/376284.375727"},{"key":"293_CR15","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Kollios, G., Tsotras, V.J., Domeniconi, C.: Approximating multi-dimensional aggregate range queries over real attributes. In: SIGMOD, pp. 463\u2013474 (2000)","DOI":"10.1145\/335191.335448"},{"issue":"4","key":"293_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/sam.10016","volume":"1","author":"PJ Haas","year":"2009","unstructured":"Haas, P.J., Ilyas, I.F., Lohman, G.M., Markl, V.: Discovering and exploiting statistical properties for query optimization in relational databases: a survey. Stat. Anal. Data Min. 1(4), 223\u2013250 (2009)","journal-title":"Stat. Anal. Data Min."},{"issue":"2","key":"293_CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/292481.277627","volume":"23","author":"JM Hellerstein","year":"1998","unstructured":"Hellerstein, J.M.: Optimization techniques for queries with expensive methods. ACM Trans. Database Syst. 23(2), 113\u2013157 (1998)","journal-title":"ACM Trans. Database Syst."},{"key":"293_CR18","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Markl, V., Haas, P.J., Brown, P., Aboulnaga, A.: CORDS: Automatic discovery of correlations and soft functional dependencies. In: SIGMOD, pp. 647\u2013658 (2004)","DOI":"10.1145\/1007568.1007641"},{"key":"293_CR19","unstructured":"Ioannidis, Y.E.: Universality of serial histograms. In: VLDB, pp. 256\u2013267 (1993)"},{"key":"293_CR20","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E.: The history of histograms (abridged). In: VLDB, pp. 19\u201330 (2003)","DOI":"10.1016\/B978-012722442-8\/50011-2"},{"key":"293_CR21","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Christodoulakis, S.: On the propagation of errors in the size of join results. In: SIGMOD, pp. 268\u2013277 (1991)","DOI":"10.1145\/119995.115835"},{"issue":"4","key":"293_CR22","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/169725.169708","volume":"18","author":"YE Ioannidis","year":"1993","unstructured":"Ioannidis, Y.E., Christodoulakis, S.: Optimal histograms for limiting worst-case error propagation in the size of join results. ACM Trans. Database Syst. 18(4), 709\u2013748 (1993)","journal-title":"ACM Trans. Database Syst."},{"key":"293_CR23","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Poosala, V.: Balancing histogram optimality and practicality for query result size estimation. In: SIGMOD, pp. 233\u2013244 (1995)","DOI":"10.1145\/568271.223841"},{"key":"293_CR24","unstructured":"Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality guarantees. In: VLDB, pp. 275\u2013286 (1998)"},{"key":"293_CR25","doi-asserted-by":"crossref","unstructured":"Jensen, F.V., Jensen, F.: Optimal junction trees. In: UAI, pp. 360\u2013366 (1994)","DOI":"10.1016\/B978-1-55860-332-5.50050-X"},{"key":"293_CR26","doi-asserted-by":"crossref","unstructured":"Kanne, C.C., Moerkotte, G.: Histograms reloaded: The merits of bucket diversity. In: SIGMOD, pp. 663\u2013674 (2010)","DOI":"10.1145\/1807167.1807239"},{"issue":"1","key":"293_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s00778-006-0030-1","volume":"16","author":"V Markl","year":"2007","unstructured":"Markl, V., Haas, P.J., Kutsch, M., Megiddo, N., Srivastava, U., Tran, T.M.: Consistent selectivity estimation via maximum entropy. VLDB J. 16(1), 55\u201376 (2007)","journal-title":"VLDB J."},{"key":"293_CR28","doi-asserted-by":"crossref","unstructured":"Markl, V., Raman, V., Simmen, D.E., Lohman, G.M., Pirahesh, H.: Robust query processing through progressive optimization. In: SIGMOD, pp. 659\u2013670 (2004)","DOI":"10.1145\/1007568.1007642"},{"key":"293_CR29","doi-asserted-by":"crossref","unstructured":"Matias, Y., Vitter, J.S., Wang, M.: Wavelet-based histograms for selectivity estimation. In: SIGMOD, pp. 448\u2013459 (1998)","DOI":"10.1145\/276305.276344"},{"issue":"1","key":"293_CR30","first-page":"982","volume":"2","author":"G Moerkotte","year":"2009","unstructured":"Moerkotte, G., Neumann, T., Steidl, G.: Preventing bad plans by bounding the impact of cardinality estimation errors. PVLDB 2(1), 982\u2013993 (2009)","journal-title":"PVLDB"},{"key":"293_CR31","doi-asserted-by":"crossref","unstructured":"Muralikrishna, M., DeWitt, D.J.: Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In: SIGMOD, pp. 28\u201336 (1988)","DOI":"10.1145\/971701.50205"},{"key":"293_CR32","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Poosala, V., Suel, T.: On rectangular partitionings in two dimensions: algorithms, complexity, and applications. In: ICDT, pp. 236\u2013256 (1999)","DOI":"10.1007\/3-540-49257-7_16"},{"key":"293_CR33","unstructured":"Poosala, V., Ioannidis, Y.E.: Selectivity estimation without the attribute value independence assumption. In: VLDB, pp. 486\u2013495 (1997)"},{"key":"293_CR34","doi-asserted-by":"crossref","unstructured":"R\u00e9, C., Suciu, D.: Understanding cardinality estimation using entropy maximization. In: PODS, pp. 53\u201364 (2010)","DOI":"10.1145\/1807085.1807095"},{"key":"293_CR35","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: SIGMOD, pp. 23\u201334 (1979)","DOI":"10.1145\/582096.582099"},{"key":"293_CR36","doi-asserted-by":"crossref","unstructured":"Spiegel, J., Polyzotis, N.: Graph-based synopses for relational selectivity estimation. In: SIGMOD, pp. 205\u2013216 (2006)","DOI":"10.1145\/1142473.1142497"},{"key":"293_CR37","unstructured":"Stillger, M., Lohman, G.M., Markl, V., Kandil, M.: Leo - db2\u2019s learning optimizer. In: VLDB, pp. 19\u201328 (2001)"},{"issue":"11","key":"293_CR38","first-page":"852","volume":"4","author":"K Tzoumas","year":"2011","unstructured":"Tzoumas, K., Deshpande, A., Jensen, C.S.: Lightweight graphical models for selectivity estimation without independence assumptions. PVLDB 4(11), 852\u2013863 (2011)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0293-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-012-0293-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-012-0293-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T08:49:43Z","timestamp":1562316583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-012-0293-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,7]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s00778-012-0293-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,7]]}}}