{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:20:30Z","timestamp":1742977230582,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466700"},{"type":"electronic","value":"9783031466717"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46671-7_21","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:02:26Z","timestamp":1699095746000},"page":"308-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Regular Path Query Evaluation with\u00a0Structural Path Constraints"],"prefix":"10.1007","author":[{"given":"Tao","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-xiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuanyu","family":"Zong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiufeng","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Arenas, M., Conca, S., P\u00e9rez, J.: Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: World Wide Web Conference, pp. 629\u2013638. ACM (2012)","DOI":"10.1145\/2187836.2187922"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Bizer, C., Vidal, M., Weiss, M.: Resource description framework. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems. Springer (2018). https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_905","DOI":"10.1007\/978-1-4614-8265-9_905"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bornea, M.A., et al.: Building an efficient RDF store over a relational database. In: ACM SIGMOD Conference, pp. 121\u2013132. ACM (2013)","DOI":"10.1145\/2463676.2463718"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-58961-9_12","volume-title":"Graph-Based Representations in Pattern Recognition","author":"V Carletti","year":"2017","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Introducing VF3: a new algorithm for subgraph isomorphism. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 128\u2013139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_12"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Han, S., Zou, L., Yu, J.X.: Speeding up set intersections in graph algorithms using SIMD instructions. In: ACM SIGMOD Conference, pp. 1587\u20131602. ACM (2018)","DOI":"10.1145\/3183713.3196924"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0129054109006747","volume":"20","author":"M Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20(4), 563\u2013580 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR7","unstructured":"Koschmieder, A.: Cost-based optimization of regular path queries on large graphs. In: Grundlagen von Datenbanken. CEUR Workshop Proceedings, vol. 581. CEUR-WS.org (2010)"},{"key":"21_CR8","first-page":"177","volume":"7338","author":"A Koschmieder","year":"2012","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. Sci. Stat. Database Manag. 7338, 177\u2013194 (2012)","journal-title":"Sci. Stat. Database Manag."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgoc, D.: Regular path queries on graphs with data. In: International Conference on Database Theory, pp. 74\u201385. ACM (2012)","DOI":"10.1145\/2274576.2274585"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Ma, H., Zhou, D., Liu, C., Lyu, M.R., King, I.: Recommender systems with social regularization. In: Web Search and Web Data Mining Conference, pp. 287\u2013296. ACM (2011)","DOI":"10.1145\/1935826.1935877"},{"key":"21_CR11","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: International Conference on Very Large Data Bases, pp. 185\u2013193. Morgan Kaufmann (1989)"},{"issue":"11","key":"21_CR12","first-page":"1692","volume":"12","author":"A Mhedhbi","year":"2019","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. VLDB J. 12(11), 1692\u20131704 (2019)","journal-title":"VLDB J."},{"issue":"1","key":"21_CR13","first-page":"647","volume":"1","author":"T Neumann","year":"2008","unstructured":"Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. VLDB J. 1(1), 647\u2013659 (2008)","journal-title":"VLDB J."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00778-015-0415-0","volume":"25","author":"P Peng","year":"2016","unstructured":"Peng, P., Zou, L., \u00d6zsu, M.T., Chen, L., Zhao, D.: Processing SPARQL queries over distributed RDF graphs. VLDB J. 25(2), 243\u2013268 (2016)","journal-title":"VLDB J."},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/TKDE.2020.2992295","volume":"34","author":"T Qiu","year":"2020","unstructured":"Qiu, T., Yang, X., Wang, B., Wang, W.: Efficient regular expression matching based on positional inverted index. IEEE Trans. Knowl. Data Eng. 34(3), 1133\u20131148 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00224-016-9676-2","volume":"61","author":"JL Reutter","year":"2017","unstructured":"Reutter, J.L., Romero, M., Vardi, M.Y.: Regular queries on graph databases. Theory Comput. Syst. 61(1), 31\u201383 (2017)","journal-title":"Theory Comput. Syst."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-91662-0_17","volume-title":"Web Engineering","author":"FC Santos","year":"2018","unstructured":"Santos, F.C., Costa, U.S., Musicante, M.A.: A Bottom-Up Algorithm for Answering Context-Free Path Queries in Graph Databases. In: Mikkonen, T., Klamma, R., Hern\u00e1ndez, J. (eds.) ICWE 2018. LNCS, vol. 10845, pp. 225\u2013233. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91662-0_17"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: In-memory subgraph matching: an in-depth study. In: ACM SIGMOD Conference, pp. 1083\u20131098. ACM (2020)","DOI":"10.1145\/3318464.3380581"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-68204-4_23","volume-title":"The Semantic Web \u2013 ISWC 2017","author":"M Wang","year":"2017","unstructured":"Wang, M., et al.: PDD graph: bridging electronic medical records and biomedical knowledge graphs via\u00a0entity linking. In: d\u2019Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10588, pp. 219\u2013227. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68204-4_23"},{"issue":"1","key":"21_CR21","first-page":"1008","volume":"1","author":"C Weiss","year":"2008","unstructured":"Weiss, C., Karras, P., Bernstein, A.: Hexastore: sextuple indexing for semantic web data management. VLDB J. 1(1), 1008\u20131019 (2008)","journal-title":"VLDB J."},{"issue":"12","key":"21_CR22","first-page":"3019","volume":"13","author":"S Wi","year":"2020","unstructured":"Wi, S., Han, W., Chang, C., Kim, K.: Towards multi-way join aware optimizer in SAP HANA. VLDB J. 13(12), 3019\u20133031 (2020)","journal-title":"VLDB J."},{"key":"21_CR23","unstructured":"Wilkinson, K., Sayers, C., Kuno, H.A., Reynolds, D.: Efficient RDF storage and retrieval in jena2. In: Semantic Web and Databases, pp. 131\u2013150 (2003)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T., Hu, L., Zhang, F.: GSI: GPU-friendly subgraph isomorphism. In: International Conference on Data Engineering. pp, 1249\u20131260. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00112"},{"issue":"11","key":"21_CR25","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1093\/comjnl\/bxu128","volume":"58","author":"X Zhang","year":"2015","unstructured":"Zhang, X., den Bussche, J.V.: On the power of SPARQL in expressing navigational queries. Comput. J. 58(11), 2841\u20132851 (2015)","journal-title":"Comput. J."},{"key":"21_CR26","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"},{"issue":"8","key":"21_CR27","first-page":"482","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou, L., Mo, J., Chen, L., \u00d6zsu, M.T., Zhao, D.: Gstore: answering SPARQL queries via subgraph matching. VLDB J. 4(8), 482\u2013493 (2011)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46671-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T11:05:32Z","timestamp":1699095932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46671-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466700","9783031466717"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46671-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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.97","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.77","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)"}}]}}