{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:36Z","timestamp":1773481836563,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030185787","type":"print"},{"value":"9783030185794","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18579-4_1","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Approach Based on Bayesian Networks for Query Selectivity Estimation"],"prefix":"10.1007","author":[{"given":"Max","family":"Halford","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Saint-Pierre","sequence":"additional","affiliation":[]},{"given":"Franck","family":"Morvan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/304181.304207","volume":"28","author":"S Acharya","year":"1999","unstructured":"Acharya, S., Gibbons, P.B., Poosala, V., Ramaswamy, S.: Join synopses for approximate query answering. ACM SIGMOD Rec. 28, 275\u2013286 (1999)","journal-title":"ACM SIGMOD Rec."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Armbrust, M., et al.: Spark SQL: relational data processing in spark. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1383\u20131394. ACM (2015)","DOI":"10.1145\/2723372.2742797"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/376284.375686","volume":"30","author":"N Bruno","year":"2001","unstructured":"Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: a multidimensional workload-aware histogram. ACM SIGMOD Rec. 30, 211\u2013222 (2001)","journal-title":"ACM SIGMOD Rec."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/304181.304206","volume":"28","author":"S Chaudhuri","year":"1999","unstructured":"Chaudhuri, S., Motwani, R., Narasayya, V.: On random sampling over joins. ACM SIGMOD Rec. 28, 263\u2013274 (1999)","journal-title":"ACM SIGMOD Rec."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C.M., Roussopoulos, N.: Adaptive selectivity estimation using query feedback, vol. 23. ACM (1994)","DOI":"10.1145\/191839.191874"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Yi, K.: Two-level sampling for join size estimation. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 759\u2013774. ACM (2017)","DOI":"10.1145\/3035918.3035921"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C Chow","year":"1968","unstructured":"Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory 14(3), 462\u2013467 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20133","key":"1_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","volume":"42","author":"GF Cooper","year":"1990","unstructured":"Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42(2\u20133), 393\u2013405 (1990)","journal-title":"Artif. Intell."},{"key":"1_CR9","unstructured":"Cowell, R.G., Dawid, P., Lauritzen, S.L., Spiegelhalter, D.J.: Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks. Springer Science & Business Media (2006)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/376284.375727","volume":"30","author":"L Getoor","year":"2001","unstructured":"Getoor, L., Taskar, B., Koller, D.: Selectivity estimation using probabilistic models. ACM SIGMOD Rec. 30, 461\u2013472 (2001)","journal-title":"ACM SIGMOD Rec."},{"issue":"3","key":"1_CR11","first-page":"197","volume":"20","author":"D Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Mach. Learn. 20(3), 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Heimel, M., Kiefer, M., Markl, V.: Self-tuning, GPU-accelerated kernel density models for multidimensional selectivity estimation. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1477\u20131492. ACM (2015)","DOI":"10.1145\/2723372.2749438"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Hellerstein, J.M.: Looking back at postgres. arXiv preprint arXiv:1901.01973 (2019)","DOI":"10.1145\/3226595.3226614"},{"key":"1_CR14","volume-title":"The Steiner Tree Problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, vol. 53. Elsevier, Amsterdam (1992)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Christodoulakis, S.: On the propagation of errors in the size of join results, vol. 20. ACM (1991)","DOI":"10.1145\/119995.115835"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","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. (TODS) 18(4), 709\u2013748 (1993)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"1_CR17","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., Meila, M.: Learning Bayesian network structure using LP relaxations. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 358\u2013365 (2010)"},{"key":"1_CR18","volume-title":"An Introduction to Bayesian Networks","author":"FV Jensen","year":"1996","unstructured":"Jensen, F.V.: An Introduction to Bayesian Networks, vol. 210. UCL Press, London (1996)"},{"key":"1_CR19","unstructured":"Kipf, A., Kipf, T., Radke, B., Leis, V., Boncz, P., Kemper, A.: Learned cardinalities: estimating correlated joins with deep learning. arXiv preprint arXiv:1809.00677 (2018)"},{"key":"1_CR20","unstructured":"Kooi, R.P.: The optimization of queries in relational databases (1980)"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endowment 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., et al.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J. 27, 1\u201326 (2018)","journal-title":"VLDB J."},{"key":"1_CR23","unstructured":"Leis, V., Radke, B., Gubichev, A., Kemper, A., Neumann, T.: Cardinality estimation done right: index-based join sampling. In: CIDR (2017)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Li, F., Wu, B., Yi, K., Zhao, Z.: Wander join: online aggregation via random walks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 615\u2013629. ACM (2016)","DOI":"10.1145\/2882903.2915235"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Naughton, J.F.: Query size estimation by adaptive sampling. In: Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 40\u201346. ACM (1990)","DOI":"10.1145\/298514.298540"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"982","DOI":"10.14778\/1687627.1687738","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. Proc. VLDB Endowment 2(1), 982\u2013993 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/971701.50205","volume":"17","author":"M Muralikrishna","year":"1988","unstructured":"Muralikrishna, M., DeWitt, D.J.: Equi-depth multidimensional histograms. SIGMOD Rec. 17, 28\u201336 (1988)","journal-title":"SIGMOD Rec."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-49257-7_16","volume-title":"Database Theory \u2014 ICDT\u201999","author":"S Muthukrishnan","year":"1999","unstructured":"Muthukrishnan, S., Poosala, V., Suel, T.: On rectangular partitionings in two dimensions: algorithms, complexity and applications. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 236\u2013256. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_16"},{"key":"1_CR29","unstructured":"Olken, F.: Random sampling from databases. Ph.D. thesis, University of California, Berkeley (1993)"},{"issue":"2","key":"1_CR30","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/971697.602294","volume":"14","author":"G Piatetsky-Shapiro","year":"1984","unstructured":"Piatetsky-Shapiro, G., Connell, C.: Accurate estimation of the number of tuples satisfying a condition. ACM SIGMOD Rec. 14(2), 256\u2013276 (1984)","journal-title":"ACM SIGMOD Rec."},{"key":"1_CR31","unstructured":"Poess, M., Nambiar, R.O., Walrath, D.: Why you should run TPC-DS: a workload analysis. In: Proceedings of the 33rd International Conference on Very Large Databases, pp. 1138\u20131149. VLDB Endowment (2007)"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/235968.233342","volume":"25","author":"V Poosala","year":"1996","unstructured":"Poosala, V., Haas, P.J., Ioannidis, Y.E., Shekita, E.J.: Improved histograms for selectivity estimation of range predicates. ACM Sigmod Rec. 25, 294\u2013305 (1996)","journal-title":"ACM Sigmod Rec."},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II: algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"1_CR34","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: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, pp. 23\u201334. ACM (1979)","DOI":"10.1145\/582096.582099"},{"key":"1_CR35","first-page":"19","volume":"1","author":"M Stillger","year":"2001","unstructured":"Stillger, M., Lohman, G.M., Markl, V., Kandil, M.: Leo-db2\u2019s learning optimizer. VLDB 1, 19\u201328 (2001)","journal-title":"VLDB"},{"key":"1_CR36","unstructured":"Traverso, M.: Presto: interacting with petabytes of data at Facebook. Retrieved February 4, 2014 (2013)"},{"issue":"11","key":"1_CR37","doi-asserted-by":"crossref","first-page":"852","DOI":"10.14778\/3402707.3402724","volume":"4","author":"K Tzoumas","year":"2011","unstructured":"Tzoumas, K., Deshpande, A., Jensen, C.S.: Lightweight graphical models for selectivity estimation without independence assumptions. Proc. VLDB Endowment 4(11), 852\u2013863 (2011)","journal-title":"Proc. VLDB Endowment"},{"issue":"12","key":"1_CR38","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/2824032.2824051","volume":"8","author":"D Vengerov","year":"2015","unstructured":"Vengerov, D., Menck, A.C., Zait, M., Chakkappen, S.P.: Join size estimation subject to filter conditions. Proc. VLDB Endowment 8(12), 1530\u20131541 (2015)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18579-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:47:16Z","timestamp":1710233236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}