{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:24:07Z","timestamp":1759991047849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001222"},{"type":"electronic","value":"9783031001239"}],"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-00123-9_2","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"21-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cross-Model Conjunctive Queries over Relation and Tree-Structured Data"],"prefix":"10.1007","author":[{"given":"Yuxing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valter","family":"Uotila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen Hua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Souripriya","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aberger, C.R., Tu, S., Olukotun, K., R\u00e9, C.: EmptyHeaded: a relational engine for graph processing. In: SIGMOD Conference, pp. 431\u2013446. ACM (2016)","DOI":"10.1145\/2882903.2915213"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. In: FOCS, pp. 739\u2013748. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.43"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. Theoret. Comput. Sci. 336(1), 3\u201331 (2005). Database Theory","DOI":"10.1016\/j.tcs.2004.10.030"},{"key":"2_CR4","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Conjunctive query containment over trees. In: Proceedings of the 11th International Conference on Database Programming Languages. DBPL 2007 (2007)"},{"issue":"12","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.17706\/jsw.10.12.1389-1401","volume":"10","author":"Z Bousalem","year":"2015","unstructured":"Bousalem, Z., Cherti, I.: XMap: a novel approach to store and retrieve XML document in relational databases. JSW 10(12), 1389\u20131401 (2015)","journal-title":"JSW"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310\u2013321. ACM (2002)","DOI":"10.1145\/564691.564727"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive datalog programs. In: PODS, pp. 55\u201366. ACM Press (1992)","DOI":"10.1145\/137097.137109"},{"key":"2_CR8","unstructured":"Ciucanu, R., Olteanu, D.: Worst-case optimal join at a time. Technical report, Oxford (2015)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2814710.2814713","volume":"44","author":"J Duggan","year":"2015","unstructured":"Duggan, J., et al.: The BigDAWG polystore system. SIGMOD Rec. 44(2), 11\u201316 (2015)","journal-title":"SIGMOD Rec."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Fischl, W., Gottlob, G., Pichler, R.: General and fractional hypertree decompositions: hard and easy cases. In: PODS, pp. 17\u201332. ACM (2018)","DOI":"10.1145\/3196959.3196962"},{"key":"2_CR11","unstructured":"Gogacz, T., Toru\u0144czyk, S.: Entropy bounds for conjunctive queries with functional dependencies. arXiv preprint arXiv:1512.01808 (2015)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11604686_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Grohe, M., Musliu, N., Samer, M., Scarcello, F.: Hypertree decompositions: structure, algorithms, and applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 1\u201315. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_1"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/1131342.1131345","volume":"53","author":"G Gottlob","year":"2006","unstructured":"Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. J. ACM 53(2), 238\u2013272 (2006)","journal-title":"J. ACM"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Lee, S.T., Valiant, G., Valiant, P.: Size and treewidth bounds for conjunctive queries. J. ACM 59(3), 16:1\u201316:35 (2012)","DOI":"10.1145\/2220357.2220363"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. ACM Trans. Algorithms 11(1) (2014). https:\/\/doi.org\/10.1145\/2636918","DOI":"10.1145\/2636918"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Hai, R., Geisler, S., Quix, C.: Constance: an intelligent data lake system. In: SIGMOD Conference, pp. 2097\u20132100. ACM (2016)","DOI":"10.1145\/2882903.2899389"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-030-30793-6_15","volume-title":"The Semantic Web \u2013 ISWC 2019","author":"A Hogan","year":"2019","unstructured":"Hogan, A., Riveros, C., Rojas, C., Soto, A.: A worst-case optimal join algorithm for SPARQL. In: Ghidini, C., et al. (eds.) ISWC 2019. LNCS, vol. 11778, pp. 258\u2013275. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30793-6_15"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"160035","DOI":"10.1038\/sdata.2016.35","volume":"3","author":"AE Johnson","year":"2016","unstructured":"Johnson, A.E., et al.: MIMIC-III, a freely accessible critical care database. Sci. Data 3, 160035 (2016)","journal-title":"Sci. Data"},{"key":"2_CR19","unstructured":"Khamis, M.A., Ngo, H.Q., Suciu, D.: Computing join queries with functional dependencies. In: PODS, pp. 327\u2013342. ACM (2016)"},{"issue":"10","key":"2_CR20","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1090\/S0002-9904-1949-09320-5","volume":"55","author":"LH Loomis","year":"1949","unstructured":"Loomis, L.H., Whitney, H.: An inequality related to the isoperimetric inequality. Bull. Am. Math. Soc. 55(10), 961\u2013962 (1949)","journal-title":"Bull. Am. Math. Soc."},{"key":"2_CR21","unstructured":"Lu, J., Holubov\u00e1, I.: Multi-model data management: what\u2019s new and what\u2019s next? In: EDBT, pp. 602\u2013605. OpenProceedings.org (2017)"},{"issue":"3","key":"2_CR22","first-page":"55:1","volume":"52","author":"J Lu","year":"2019","unstructured":"Lu, J., Holubov\u00e1, I.: Multi-model databases: a new journey to handle the variety of data. ACM Comput. Surv. 52(3), 55:1-55:38 (2019)","journal-title":"ACM Comput. Surv."},{"key":"2_CR23","unstructured":"Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From region encoding to extended dewey: on efficient processing of XML twig pattern matching. In: VLDB, pp. 193\u2013204. ACM (2005)"},{"key":"2_CR24","unstructured":"Lu, J., Liu, Z.H., Xu, P., Zhang, C.: UDBMS: road to unification for multi-model data management. CoRR abs\/1612.08050 (2016)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Nassiri, H., Machkour, M., Hachimi, M.: One query to retrieve XML and relational data. Procedia Comput. Sci. 134, 340\u2013345 (2018). FNC\/MobiSPC","DOI":"10.1016\/j.procs.2018.07.201"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3180143","volume":"65","author":"HQ Ngo","year":"2018","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms. J. ACM 65(3), 16:1-16:40 (2018)","journal-title":"J. ACM"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2013","unstructured":"Ngo, H.Q., R\u00e9, C., Rudra, A.: Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4), 5\u201316 (2013)","journal-title":"SIGMOD Rec."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen, D.T., et al.: Join processing for graph patterns: an old dog with new tricks. In: GRADES@SIGMOD\/PODS, pp. 2:1\u20132:8. ACM (2015)","DOI":"10.1145\/2764947.2764948"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Qtaish, A., Ahmad, K.: XAncestor: an efficient mapping approach for storing and querying XML documents in relational database using path-based technique. Knowl.-Based Syst. 114, 167\u2013192 (2016)","DOI":"10.1016\/j.knosys.2016.10.009"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: a benchmark for XML data management. In: VLDB, pp. 974\u2013985. Morgan Kaufmann (2002)","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"2_CR31","unstructured":"Veldhuizen, T.L.: Leapfrog triejoin: a simple, worst-case optimal join algorithm. arXiv preprint arXiv:1210.0481 (2012)"},{"issue":"2","key":"2_CR32","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S135132490400364X","volume":"11","author":"N Xue","year":"2005","unstructured":"Xue, N., Xia, F., Chiou, F.D., Palmer, M.: The Penn Chinese TreeBank: phrase structure annotation of a large corpus. Nat. Lang. Eng. 11(2), 207\u2013238 (2005)","journal-title":"Nat. Lang. Eng."},{"key":"2_CR33","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB, pp. 82\u201394. IEEE Computer Society (1981)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-030-11404-6_2","volume-title":"Performance Evaluation and Benchmarking for the Era of Artificial Intelligence","author":"C Zhang","year":"2019","unstructured":"Zhang, C., Lu, J., Xu, P., Chen, Y.: UniBench: a benchmark for multi-model database management systems. In: Nambiar, R., Poess, M. (eds.) TPCTC 2018. LNCS, vol. 11135, pp. 7\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11404-6_2"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Zhu, H., Yu, H., Fan, G., Sun, H.: Mini-XML: an efficient mapping approach between XML and relational database. In: ICIS, pp. 839\u2013843. IEEE Computer Society (2017)","DOI":"10.1109\/ICIS.2017.7960109"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:15:17Z","timestamp":1651007717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_2","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":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","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":"72","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":"76","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":"13% - 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":"6","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":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","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)"}}]}}