{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:16:49Z","timestamp":1742933809672,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247637"},{"type":"electronic","value":"9783642247644"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24764-4_3","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T01:21:39Z","timestamp":1320801699000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["Uncertainty That Counts"],"prefix":"10.1007","author":[{"given":"Dany","family":"Maslowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jef","family":"Wijsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/303976.303983","volume-title":"PODS","author":"M. Arenas","year":"1999","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68\u201379. ACM Press, New York (1999)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0304-3975(02)00737-5","volume":"296","author":"M. Arenas","year":"2003","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theor. Comput. Sci.\u00a0296(3), 405\u2013434 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"3_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1538788.1538810","volume":"52","author":"N.N. Dalvi","year":"2009","unstructured":"Dalvi, N.N., R\u00e9, C., Suciu, D.: Probabilistic databases: diamonds in the dirt. Commun. ACM\u00a052(7), 86\u201394 (2009)","journal-title":"Commun. ACM"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.jcss.2010.04.006","volume":"77","author":"N.N. Dalvi","year":"2011","unstructured":"Dalvi, N.N., Re, C., Suciu, D.: Queries and materialized views on probabilistic databases. J. Comput. Syst. Sci.\u00a077(3), 473\u2013490 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","first-page":"1","volume-title":"PODS","author":"N.N. Dalvi","year":"2007","unstructured":"Dalvi, N.N., Suciu, D.: Management of probabilistic data: foundations and challenges. In: Libkin, L. (ed.) PODS, pp. 1\u201312. ACM, New York (2007)"},{"key":"3_CR7","first-page":"71","volume-title":"PODS","author":"W. Fan","year":"2011","unstructured":"Fan, W., Geerts, F., Wijsen, J.: Determining the currency of data. In: Lenzerini, M., Schwentick, T. (eds.) PODS, pp. 71\u201382. ACM, New York (2011)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.jcss.2006.10.013","volume":"73","author":"A. Fuxman","year":"2007","unstructured":"Fuxman, A., Miller, R.J.: First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci.\u00a073(4), 610\u2013635 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-87877-3_23","volume-title":"Conceptual Modeling - ER 2008","author":"S. Greco","year":"2008","unstructured":"Greco, S., Molinaro, C.: Approximate probabilistic query answering over inconsistent databases. In: Li, Q., Spaccapietra, S., Yu, E.S.K., Oliv\u00e9, A. (eds.) ER 2008. LNCS, vol.\u00a05231, pp. 311\u2013325. Springer, Heidelberg (2008)"},{"key":"3_CR10","first-page":"15","volume-title":"Proceedings of the 4th International Workshop on Logic in Databases, LID 2011","author":"D. Maslowski","year":"2011","unstructured":"Maslowski, D., Wijsen, J.: On counting database repairs. In: Proceedings of the 4th International Workshop on Logic in Databases, LID 2011, pp. 15\u201322. ACM, New York (2011), http:\/\/doi.acm.org\/10.1145\/1966357.1966361"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1966874.1966881","volume-title":"Proceedings of the 2011 Joint EDBT\/ICDT Ph.D. Workshop, PhD 2011","author":"E. Pema","year":"2011","unstructured":"Pema, E., Kolaitis, P.G., Tan, W.C.: On the tractability and intractability of consistent conjunctive query answering. In: Proceedings of the 2011 Joint EDBT\/ICDT Ph.D. Workshop, PhD 2011, pp. 38\u201344. ACM, New York (2011), http:\/\/doi.acm.org\/10.1145\/1966874.1966881"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput.\u00a020(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"3_CR13","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.is.2009.03.011","volume":"34","author":"J. Wijsen","year":"2009","unstructured":"Wijsen, J.: On the consistent rewriting of conjunctive queries under primary key constraints. Inf. Syst.\u00a034(7), 578\u2013601 (2009)","journal-title":"Inf. Syst."},{"key":"3_CR14","first-page":"179","volume-title":"PODS","author":"J. Wijsen","year":"2010","unstructured":"Wijsen, J.: On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In: Paredaens, J., Gucht, D.V. (eds.) PODS, pp. 179\u2013190. ACM, New York (2010)"},{"issue":"21","key":"3_CR15","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.ipl.2010.07.021","volume":"110","author":"J. Wijsen","year":"2010","unstructured":"Wijsen, J.: A remark on the complexity of consistent conjunctive query answering under primary key violations. Inf. Process. Lett.\u00a0110(21), 950\u2013955 (2010)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24764-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T19:13:21Z","timestamp":1639595601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24764-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247637","9783642247644"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24764-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}