{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:15:05Z","timestamp":1743092105441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_12","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"149-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Hard Is Completeness Reasoning for Conjunctive Queries?"],"prefix":"10.1007","author":[{"given":"Xianmin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"12_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/0208017","volume":"8","author":"AV Aho","year":"1979","unstructured":"Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences among relational expressions. SIAM J. Comput. 8(2), 218\u2013246 (1979)","journal-title":"SIAM J. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cai, Z., Miao, D., Li, Y.: Deletion propagation for multiple key preserving conjunctive queries: approximations and complexity. In: ICDE 2019, pp. 506\u2013517 (2019)","DOI":"10.1109\/ICDE.2019.00052"},{"issue":"3","key":"12_CR4","first-page":"23","volume":"7","author":"EF Codd","year":"1975","unstructured":"Codd, E.F.: Understanding relations (installment #7). FDT - Bull. ACM SIGMOD 7(3), 23\u201328 (1975)","journal-title":"FDT - Bull. ACM SIGMOD"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Console, M., Guagliardo, P., Libkin, L.: On querying incomplete information in databases under bag semantics. In: IJCAI 2017, pp. 993\u2013999 (2017)","DOI":"10.24963\/ijcai.2017\/138"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0097539799360768","volume":"31","author":"J Flum","year":"2001","unstructured":"Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model-checking. SIAM J. Comput. 31(1), 113\u2013145 (2001)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Han, Y., Sun, G., Shen, Y., Zhang, X.: Multi-label learning with highly incomplete data via collaborative embedding. In: KDD 2018, pp. 1494\u20131503 (2018)","DOI":"10.1145\/3219819.3220038"},{"key":"12_CR9","unstructured":"Levy,A.Y.: Obtaining complete answers from incomplete databases. In: VLDB 1996, Proceedings of 22th International Conference on Very Large Data Bases, 3\u20136 September 1996, pp. 402\u2013412, Mumbai (1996)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2017.08.017","volume":"749","author":"X Liu","year":"2018","unstructured":"Liu, X., Cai, Z., Miao, D., Li, J.: Tree size reduction with keeping distinguishability. Theor. Comput. Sci. 749, 26\u201335 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/TKDE.2017.2758361","volume":"30","author":"D Miao","year":"2018","unstructured":"Miao, D., Cai, Z., Li, J.: On the complexity of bounded view propagation for conjunctive queries. IEEE Trans. Knowl. Data Eng. 30(1), 115\u2013127 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.tcs.2015.02.010","volume":"609","author":"D Miao","year":"2016","unstructured":"Miao, D., Liu, X., Li, J.: On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theor. Comput. Sci. 609, 594\u2013605 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Razniewski, S., Korn, F., Nutt, W., Srivastava, D.: Identifying the extent of completeness of query answers over partially complete databases. In: SIGMOD 2015, pp. 561\u2013576 (2015)","DOI":"10.1145\/2723372.2750544"},{"issue":"11","key":"12_CR14","first-page":"749","volume":"4","author":"S Razniewski","year":"2011","unstructured":"Razniewski, S., Nutt, W.: Completeness of queries over incomplete databases. PVLDB 4(11), 749\u2013760 (2011)","journal-title":"PVLDB"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Tang, X., et al.: Joint modeling of dense and incomplete trajectories for citywide traffic volume inference. In: WWW 2019, pp. 1806\u20131817 (2019)","DOI":"10.1145\/3308558.3313621"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:35:49Z","timestamp":1619242549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","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":"54","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":"0","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}