{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:02Z","timestamp":1743154262602,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031155116"},{"type":"electronic","value":"9783031155123"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15512-3_16","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:02:55Z","timestamp":1661486575000},"page":"185-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Database States Exhibiting Tree Projection Necessity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4304-310X","authenticated-orcid":false,"given":"Oded","family":"Shmueli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/322234.322238","volume":"28","author":"PA Bernstein","year":"1981","unstructured":"Bernstein, P.A., Chiu, D.W.: Using semi-joins to solve relational queries. J. ACM 28(1), 25\u201340 (1981)","journal-title":"J. ACM"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM J. Comput. 10(4), 751\u2013771 (1981). https:\/\/doi.org\/10.1137\/0210059, https:\/\/doi.org\/10.1137\/0210059","DOI":"10.1137\/0210059"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Goodman, N., Shmueli, O.: Syntactic characterization of tree database schemas. J. ACM 30(4), 767\u2013786 (1983). https:\/\/doi.org\/10.1145\/2157.322405, http:\/\/doi.acm.org\/10.1145\/2157.322405","DOI":"10.1145\/2157.322405"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Goodman, N., Shmueli, O.: The tree projection theorem and relational query processing. J. Comput. Syst. Sci. 28(1), 60\u201379 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90076-X, https:\/\/doi.org\/10.1016\/0022-0000(84)90076-X","DOI":"10.1016\/0022-0000(84)90076-X"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Greco, G., Scarcello, F.: The power of local consistency in conjunctive queries and constraint satisfaction problems. SIAM J. Comput. 46(3), 1111\u20131145 (2017). https:\/\/doi.org\/10.1137\/16M1090272, https:\/\/doi.org\/10.1137\/16M1090272","DOI":"10.1137\/16M1090272"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Sagiv, Y., Shmueli, O.: Solving queries by tree projections. ACM Trans. Database Syst. 18(3), 487\u2013511 (1993). https:\/\/doi.org\/10.1145\/155271.155277, http:\/\/doi.acm.org\/10.1145\/155271.155277","DOI":"10.1145\/155271.155277"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15512-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:06:06Z","timestamp":1661486766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15512-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031155116","9783031155123"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15512-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sidney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2022.github.io\/index.html","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":"36","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":"9","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":"8","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":"25% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}