{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:51:58Z","timestamp":1742935918467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_9","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T16:16:47Z","timestamp":1628612207000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Standard Matching-Choice Expressions for Defining Path Queries in Graph Databases"],"prefix":"10.1007","author":[{"given":"Ciro","family":"Medeiros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Musicante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)","key":"9_CR1"},{"doi-asserted-by":"publisher","unstructured":"Francis, N., et al.: Cypher: an evolving query language for property graphs. In: Proceedings of SIGMOD\u20192018, pp. 1433\u20131445. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3183713.3190657","key":"9_CR2","DOI":"10.1145\/3183713.3190657"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00224-012-9389-0","volume":"53","author":"D Freydenberger","year":"2012","unstructured":"Freydenberger, D.: Extended regular expressions: succinctness and decidability. Theory Comput. Syst. 53(2), 159\u2013193 (2012). https:\/\/doi.org\/10.1007\/s00224-012-9389-0","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"publisher","unstructured":"Hellings, J.: Conjunctive context-free path queries. In: Schweikardt, N., Christophides, V., Leroy, V. (eds.) Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, 24\u201328 March 2014, pp. 119\u2013130. OpenProceedings.org (2014). https:\/\/doi.org\/10.5441\/002\/icdt.2014.15","key":"9_CR4","DOI":"10.5441\/002\/icdt.2014.15"},{"doi-asserted-by":"crossref","unstructured":"Kuijpers, J., Fletcher, G., Yakovets, N., Lindaaker, T.: An experimental study of context-free path query evaluation methods. In: Proceedings of the SSDBM\u20192019, pp. 121\u2013132. ACM (2019)","key":"9_CR5","DOI":"10.1145\/3335783.3335791"},{"key":"9_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-55814-7_6","volume-title":"ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium","author":"C Medeiros","year":"2020","unstructured":"Medeiros, C., Costa, U., Grigorev, S., Musicante, M.A.: Recursive expressions for SPARQL property paths. In: Bellatreche, L., et al. (eds.) TPDL\/ADBIS -2020. CCIS, vol. 1260, pp. 72\u201384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55814-7_6"},{"key":"9_CR7","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). https:\/\/doi.org\/10.1016\/j.cola.2019.02.002","journal-title":"J. Comput. Lang."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-88564-1_5","volume-title":"The Semantic Web - ISWC 2008","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: nSPARQL: a navigational language for RDF. In: Sheth, A., et al. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 66\u201381. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88564-1_5"},{"unstructured":"Prud\u2019hommeaux, E., Seaborne, A.: SPARQL query language for RDF (2008). Latest version available as http:\/\/www.w3.org\/TR\/rdf-sparql-query\/","key":"9_CR9"},{"unstructured":"Sempere, J.: On a class of regular-like expressions for linear languages. J. Automata Lang. Comb. 5, 343\u2013354 (2000)","key":"9_CR10"},{"unstructured":"Spiegel, J., Dyck, M., Robie, J.: XML path language (XPath) 3.1. W3C recommendation, W3C (2017). https:\/\/www.w3.org\/TR\/2017\/REC-xpath-31-20170321\/","key":"9_CR11"},{"unstructured":"W3C: SPARQL 1.1 query language (2012). https:\/\/www.w3.org\/TR\/2012\/PR-sparql11-query-20121108\/","key":"9_CR12"},{"unstructured":"W3C: RDF - semantics web standards (2014). https:\/\/www.w3.org\/RDF\/","key":"9_CR13"},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","volume":"10","author":"M Yntema","year":"1967","unstructured":"Yntema, M.: Inclusion relations among families of context-free languages. Inf. Control 10(6), 572\u2013597 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)91032-7","journal-title":"Inf. Control"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0019-9958(71)90419-0","volume":"18","author":"M Yntema","year":"1971","unstructured":"Yntema, M.: Cap expressions for context-free languages. Inf. Control 18(4), 311\u2013318 (1971). https:\/\/doi.org\/10.1016\/S0019-9958(71)90419-0","journal-title":"Inf. Control"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-319-46523-4_38","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Feng, Z., Wang, X., Rao, G., Wu, W.: Context-free path queries on RDF graphs. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 632\u2013648. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46523-4_38"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:46:18Z","timestamp":1710348378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85082-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850814","9783030850821"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85082-1_9","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)"}}]}}