{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:54:00Z","timestamp":1742986440274,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850814"},{"type":"electronic","value":"9783030850821"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85082-1_13","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T16:16:47Z","timestamp":1628612207000},"page":"139-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Formal-Language-Constrained Graph Minimization Problem"],"prefix":"10.1007","author":[{"given":"Ciro","family":"Medeiros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Musicante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirian","family":"Halfeld-Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"key":"13_CR1","unstructured":"Anciaux, N., Nguyen, B., Vazirgiannis, M.: Miminum exposure in classification scenarios. Research report (2011)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Grau, B.C., Kostylev, E.V.: Logical foundations of privacy-preserving publishing of linked data. In: 30th AAAI Conference on Artificial Intelligence, pp. 52\u201395 (2016)","DOI":"10.1609\/aaai.v30i1.10105"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-030-34223-4_31","volume-title":"Web Information Systems Engineering \u2013 WISE 2019","author":"R Delanaux","year":"2019","unstructured":"Delanaux, R., Bonifati, A., Rousset, M.-C., Thion, R.: RDF graph anonymization robust to data linkage. In: Cheng, R., Mamoulis, N., Sun, Y., Huang, X. (eds.) WISE 2020. LNCS, vol. 11881, pp. 491\u2013506. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34223-4_31"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/COMST.2016.2633620","volume":"19","author":"S Ji","year":"2017","unstructured":"Ji, S., Mittal, P., Beyah, R.: Graph data anonymization, de-anonymization attacks, and de-anonymizability quantification: a survey. IEEE Commun. Surv. Tutor. 19(2), 1305\u20131326 (2017)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Medeiros, C.M., Musicante, M.A., Costa, U.S.: An algorithm for context-free path queries over graph databases. In: Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity, SBLP 2020, New York, NY, USA, pp. 40\u201347. ACM (2020)","DOI":"10.1145\/3427081.3427087"},{"key":"13_CR6","unstructured":"Anciaux, N., Nguyen, B., Vazirgiannis, M.: Limiting data collection in online forms. IEEE PST (2012)"},{"key":"13_CR7","unstructured":"Alimonti, P., Ausiello, G., Giovaniello, L., Protasi, M.: On the complexity of approximating weighted satisfiability problems (extended abstract) (1997)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cola.2019.02.002","volume":"51","author":"CM Medeiros","year":"2019","unstructured":"Medeiros, C.M., Musicante, M.A., Costa, U.S.: LL-based query answering over RDF databases. J. Comput. Lang. 51, 75\u201387 (2019)","journal-title":"J. Comput. Lang."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Li, Y., Zhang, Q., Reps, T.: Fast graph simplification for interleaved Dyck-reachability. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 780\u2013793 (2020)","DOI":"10.1145\/3385412.3386021"}],"container-title":["Communications in Computer and Information Science","New Trends in Database and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85082-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:46:34Z","timestamp":1710348394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85082-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850814","9783030850821"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85082-1_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tartu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2021.cs.ut.ee\/","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":"70","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":"18","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":"26% - 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":"Workshops: submissions: 17,  papers accepted: DOING 2021: 3, SIMPDA 2021: 1, MADEISD 2021: 4, MegaData 2021: 1, CAoNS 2021: 2","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)"}}]}}