{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:29:40Z","timestamp":1783700980633,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030624187","type":"print"},{"value":"9783030624194","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62419-4_7","type":"book-chapter","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T17:13:40Z","timestamp":1604164420000},"page":"110-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Generating Compact and Relaxable Answers to Keyword Queries over Knowledge Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3539-7776","authenticated-orcid":false,"given":"Gong","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ke","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengkai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Chen, C., Wang, G., Liu, H., Xin, J., Yuan, Y.: SISP: a new framework for searching the informative subgraph based on PSO. In: CIKM, pp. 453\u2013462 (2011)","DOI":"10.1145\/2063576.2063645"},{"issue":"Summer","key":"7_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/3409481.3409484","volume":"2020","author":"G Cheng","year":"2020","unstructured":"Cheng, G.: Relationship search over knowledge graphs. ACM SIGWEB Newsl. 2020(Summer), 3 (2020)","journal-title":"ACM SIGWEB Newsl."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-46523-4_8","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"G Cheng","year":"2016","unstructured":"Cheng, G., Liu, D., Qu, Y.: Efficient algorithms for association finding and frequent association pattern mining. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 119\u2013134. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46523-4_8"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Cheng, G., Liu, D., Qu, Y.: Fast algorithms for semantic association search and pattern mining. IEEE Trans. Knowl. Data Eng. Early Access, 1\u201313 (2019). https:\/\/doi.org\/10.1109\/TKDE.2019.2942031","DOI":"10.1109\/TKDE.2019.2942031"},{"issue":"11","key":"7_CR5","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1109\/TKDE.2017.2735970","volume":"29","author":"G Cheng","year":"2017","unstructured":"Cheng, G., Shao, F., Qu, Y.: An empirical evaluation of techniques for ranking semantic associations. IEEE Trans. Knowl. Data Eng. 29(11), 2388\u20132401 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TKDE.2012.228","volume":"26","author":"J Coffman","year":"2014","unstructured":"Coffman, J., Weaver, A.C.: An empirical performance evaluation of relational keyword search techniques. IEEE Trans. Knowl. Data Eng. 26(1), 30\u201342 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Dosso, D., Silvello, G.: A scalable virtual document-based keyword search system for RDF datasets. In: SIGIR, pp. 965\u2013968 (2019)","DOI":"10.1145\/3331184.3331284"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-21064-8_5","volume-title":"The Semanic Web: Research and Applications","author":"S Elbassuoni","year":"2011","unstructured":"Elbassuoni, S., Ramanath, M., Weikum, G.: Query relaxation for entity-relationship search. In: Antoniou, G., et al. (eds.) ESWC 2011. LNCS, vol. 6644, pp. 62\u201376. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21064-8_5"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Fu, H., Anyanwu, K.: Effectively interpreting keyword queries on RDF databases with a rear view. In: ISWC, pp. 193\u2013208 (2011)","DOI":"10.1007\/978-3-642-25073-6_13"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Hasibi, F., et al.: DBpedia-entity v2: a test collection for entity search. In: SIGIR, pp. 1265\u20131268 (2017)","DOI":"10.1145\/3077136.3080751"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Huang, Z., Li, S., Cheng, G., Kharlamov, E., Qu, Y.: MiCRon: making sense of news via relationship subgraphs. In: CIKM, pp. 2901\u20132904 (2019)","DOI":"10.1145\/3357384.3357856"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-55121-2_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Ihler","year":"1992","unstructured":"Ihler, E.: The complexity of approximating the class Steiner tree problem. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 85\u201396. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55121-2_8"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Kasneci, G., Elbassuoni, S., Weikum, G.: MING: mining informative entity relationship subgraphs. In: CIKM, pp. 1653\u20131656 (2009)","DOI":"10.1145\/1645953.1646196"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp. 903\u2013914 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Efficient and progressive group steiner tree search. In: SIGMOD, pp. 91\u2013106 (2016)","DOI":"10.1145\/2882903.2915217"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"100557","DOI":"10.1016\/j.websem.2020.100557","volume":"61\u201362","author":"S Li","year":"2020","unstructured":"Li, S., Cheng, G., Li, C.: Relaxing relationship queries on graph data. J. Web Semant. 61\u201362, 100557 (2020)","journal-title":"J. Web Semant."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Lu, X., Pramanik, S., Roy, R.S., Abujabal, A., Wang, Y., Weikum, G.: Answering complex questions by joining multi-document evidence with quasi knowledge graphs. In: SIGIR, pp. 105\u2013114 (2019)","DOI":"10.1145\/3331184.3331252"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1121949.1121979","volume":"49","author":"G Marchionini","year":"2006","unstructured":"Marchionini, G.: Exploratory search: from finding to understanding. Commun. ACM 49(4), 41\u201346 (2006)","journal-title":"Commun. ACM"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Miller, A.H., Fisch, A., Dodge, J., Karimi, A., Bordes, A., Weston, J.: Key-value memory networks for directly reading documents. In: EMNLP, pp. 1400\u20131409 (2016)","DOI":"10.18653\/v1\/D16-1147"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.websem.2016.08.001","volume":"40","author":"A Poulovassilis","year":"2016","unstructured":"Poulovassilis, A., Selmer, P., Wood, P.T.: Approximation and relaxation of semantic web path queries. J. Web Semant. 40, 1\u201321 (2016)","journal-title":"J. Web Semant."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Shekarpour, S., Ngomo, A.N., Auer, S.: Question answering on interlinked data. In: WWW, pp. 1145\u20131156 (2013)","DOI":"10.1145\/2488388.2488488"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Shi, Y., Cheng, G., Kharlamov, E.: Keyword search over knowledge graphs via static and dynamic hub labelings. In: WWW, pp. 235\u2013245 (2020)","DOI":"10.1145\/3366423.3380110"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404\u2013413 (2006)","DOI":"10.1145\/1150402.1150448"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.websem.2011.08.004","volume":"9","author":"T Tran","year":"2011","unstructured":"Tran, T., Herzig, D.M., Ladwig, G.: SemSearchPro - using semantics throughout the search process. J. Web Semant. 9(4), 349\u2013364 (2011)","journal-title":"J. Web Semant."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-00671-6_30","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"M Wang","year":"2018","unstructured":"Wang, M., Wang, R., Liu, J., Chen, Y., Zhang, L., Qi, G.: Towards empty answers in SPARQL: approximating querying with RDF embedding. In: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 513\u2013529. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00671-6_30"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Zhiltsov, N., Kotov, A., Nikolaev, F.: Fielded sequential dependence model for ad-hoc entity retrieval in the web of data. In: SIGIR, pp. 253\u2013262 (2015)","DOI":"10.1145\/2766462.2767756"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62419-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T23:01:57Z","timestamp":1761865317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62419-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030624187","9783030624194"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62419-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2020.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind for the Research Track; single-blind for the Resources and In-use Track","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":"287","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":"81","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":"28% - 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-4","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-7","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":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}