{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T13:13:29Z","timestamp":1771679609838,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031398469","type":"print"},{"value":"9783031398476","type":"electronic"}],"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-39847-6_37","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"462-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["KBQA: Accelerate Fuzzy Path Query on\u00a0Knowledge Graph"],"prefix":"10.1007","author":[{"given":"Li","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiheng","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shizheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongqian","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"key":"37_CR1","unstructured":"SPARQL 1.1. In: Alhajj, R., Rokne, J.G. (eds.) Encyclopedia of Social Network Analysis and Mining, 2nd Edition. Springer (2018)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-11964-9_13","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"G Alu\u00e7","year":"2014","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 197\u2013212. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_13"},{"issue":"5","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.3390\/e12051264","volume":"12","author":"J Borge-Holthoefer","year":"2010","unstructured":"Borge-Holthoefer, J., Arenas, A.: Semantic networks: structure and dynamics. Entropy 12(5), 1264\u20131302 (2010). https:\/\/doi.org\/10.3390\/e12051264","journal-title":"Entropy"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Berry, M.W., Dayal, U., Kamath, C., Skillicorn, D.B. (eds.) Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22\u201324, 2004, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Chang, Y., Kong, L., Jia, K., Meng, Q.: Chinese named entity recognition method based on BERT. In: 2021 IEEE International Conference on Data Science and Computer Application (ICDSCA), pp. 294\u2013299. IEEE (2021)","DOI":"10.1109\/ICDSCA53499.2021.9650256"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-26428-8_10","volume-title":"OpenSHMEM and Related Technologies. Experiences, Implementations, and Technologies","author":"EF D\u2019Azevedo","year":"2015","unstructured":"D\u2019Azevedo, E.F., Imam, N.: Graph 500 in OpenSHMEM. In: Gorentla Venkata, M., Shamis, P., Imam, N., Lopez, M.G. (eds.) OpenSHMEM 2014. LNCS, vol. 9397, pp. 154\u2013163. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26428-8_10"},{"key":"37_CR7","unstructured":"Deutsch, A., Yu, X., Wu, M., Lee, V.: Tigergraph: A native MPP graph database. arXiv (2019)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Deutsch, A., et al.: Graph pattern matching in GQL and SQL\/PGQ. In: SIGMOD, pp. 2246\u20132258. ACM (2022)","DOI":"10.1145\/3514221.3526057"},{"key":"37_CR9","unstructured":"Dohmen, L.: Algorithms for large networks in the NoSQL database Arangodb. Bachelor Thesis of RWTH Aachen University (2012)"},{"issue":"1","key":"37_CR10","first-page":"3","volume":"35","author":"O Erling","year":"2012","unstructured":"Erling, O.: Virtuoso, a hybrid RDBMS\/graph column store. IEEE Data Eng. Bull. 35(1), 3\u20138 (2012)","journal-title":"IEEE Data Eng. Bull."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Francis, N., et al.: Cypher: An evolving query language for property graphs. In: SIGMOD, pp. 1433\u20131445. ACM (2018)","DOI":"10.1145\/3183713.3190657"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Guia, J., Soares, V.G., Bernardino, J.: Graph databases: Neo4j analysis. In: ICEIS 2017 - Proceedings of the 19th International Conference on Enterprise Information Systems, Volume 1, Porto, Portugal, 26\u201329 April 2017, pp. 351\u2013356 (2017)","DOI":"10.5220\/0006356003510356"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Han, M., Kim, H., Gu, G., Park, K., Han, W.: Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, 30 June\u20135 July 2019, pp. 1429\u20131446. ACM (2019)","DOI":"10.1145\/3299869.3319880"},{"key":"37_CR14","unstructured":"Hogan, A., Reutter, J.L., Soto, A.: Recursive SPARQL for graph analytics. arXiv abs\/2004.01816 (2020)"},{"key":"37_CR15","first-page":"550","volume":"3","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: Retrieval on secondary keys. Art Comput. Program. Sorting Searching 3, 550\u2013567 (1997)","journal-title":"Art Comput. Program. Sorting Searching"},{"key":"37_CR16","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"5","key":"37_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1108\/09696470510700394","volume":"12","author":"M Lytras","year":"2005","unstructured":"Lytras, M., Downes, S.: Semantic networks and social networks. Learn. Organ. 12(5), 411\u2013417 (2005)","journal-title":"Learn. Organ."},{"issue":"6","key":"37_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MIC.2002.1067737","volume":"6","author":"B McBride","year":"2002","unstructured":"McBride, B.: Jena: a semantic web toolkit. IEEE Internet Comput. 6(6), 55\u201359 (2002)","journal-title":"IEEE Internet Comput."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. VLDB (2019)","DOI":"10.14778\/3342263.3342643"},{"issue":"1","key":"37_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q.: Worst-case optimal join algorithms: techniques, results, and open problems. In: PODS (2018)","DOI":"10.1145\/3196959.3196990"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms: [extended abstract]. In: PODS (2012)","DOI":"10.1145\/2213556.2213565"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Nol\u00e9, M., Sartiani, C.: Regular path queries on massive graphs. In: Proceedings of the 28th International Conference on Scientific and Statistical Database Management, SSDBM 2016, Budapest, Hungary, 18\u201320 July 2016, pp. 13:1\u201313:12. ACM (2016)","DOI":"10.1145\/2949689.2949711"},{"key":"37_CR24","doi-asserted-by":"publisher","unstructured":"Rajaraman, A., Ullman, J.D.: Data Mining, pp. 1\u201317. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9781139058452.002","DOI":"10.1017\/CBO9781139058452.002"},{"key":"37_CR25","unstructured":"Sowa, J.F.: Semantic networks. Encycl. Cogn. Sci. (2012)"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Wei, H., Yu, J.X., Lu, C., Lin, X.: Speedup graph processing by graph ordering. In: \u00d6zcan, F., Koutrika, G., Madden, S. (eds.) Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June 01 July 2016, pp. 1813\u20131828. ACM (2016)","DOI":"10.1145\/2882903.2915220"},{"key":"37_CR27","unstructured":"Zeng, L., Jiang, Y., Lu, W., Zou, L.: Deep analysis on subgraph isomorphism. arXiv (2020)"},{"key":"37_CR28","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-031-00129-1_37","volume-title":"Database Systems for Advanced Applications","author":"L Zeng","year":"2022","unstructured":"Zeng, L., Zhou, J., Qin, S., Cai, H., Zhao, R., Chen, X.: SQLG+: efficient-hop query processing on RDBMS. In: Bhattacharya, A., et al. (eds.) DASFAA 2022. LNCS, pp. 430\u2013442. Springer, Cham (2022)"},{"key":"37_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11704-018-7212-z","volume":"12","author":"L Zeng","year":"2018","unstructured":"Zeng, L., Zou, L.: Redesign of the gStore system. Front. Comput. Sci. 12, 623\u2013641 (2018)","journal-title":"Front. Comput. Sci."},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T., Hu, L., Zhang, F.: GSI: GPU-friendly subgraph isomorphism. In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20\u201324, 2020, pp. 1249\u20131260. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00112"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T.: SGSI - a scalable GPU-friendly subgraph isomorphism algorithm. IEEE Trans. Knowl. Data Eng. 1\u201317 (2022)","DOI":"10.1109\/TKDE.2022.3230744"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:31:06Z","timestamp":1710333066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","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":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","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":"49","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":"35","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":"32% - 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":"4","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":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","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)"}}]}}